![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rexxfrd | Structured version Visualization version GIF version |
Description: Transfer universal quantification from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. (Contributed by FL, 10-Apr-2007.) (Revised by Mario Carneiro, 15-Aug-2014.) |
Ref | Expression |
---|---|
ralxfrd.1 | ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → 𝐴 ∈ 𝐵) |
ralxfrd.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴) |
ralxfrd.3 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
rexxfrd | ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 𝜓 ↔ ∃𝑦 ∈ 𝐶 𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralxfrd.1 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → 𝐴 ∈ 𝐵) | |
2 | ralxfrd.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴) | |
3 | ralxfrd.3 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒)) | |
4 | 3 | notbid 307 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (¬ 𝜓 ↔ ¬ 𝜒)) |
5 | 1, 2, 4 | ralxfrd 5008 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ¬ 𝜓 ↔ ∀𝑦 ∈ 𝐶 ¬ 𝜒)) |
6 | 5 | notbid 307 | . 2 ⊢ (𝜑 → (¬ ∀𝑥 ∈ 𝐵 ¬ 𝜓 ↔ ¬ ∀𝑦 ∈ 𝐶 ¬ 𝜒)) |
7 | dfrex2 3144 | . 2 ⊢ (∃𝑥 ∈ 𝐵 𝜓 ↔ ¬ ∀𝑥 ∈ 𝐵 ¬ 𝜓) | |
8 | dfrex2 3144 | . 2 ⊢ (∃𝑦 ∈ 𝐶 𝜒 ↔ ¬ ∀𝑦 ∈ 𝐶 ¬ 𝜒) | |
9 | 6, 7, 8 | 3bitr4g 303 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 𝜓 ↔ ∃𝑦 ∈ 𝐶 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 382 = wceq 1631 ∈ wcel 2145 ∀wral 3061 ∃wrex 3062 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ral 3066 df-rex 3067 df-v 3353 |
This theorem is referenced by: cmpfi 21432 elfm 21971 rlimcnp 24913 rmoxfrdOLD 29671 rmoxfrd 29672 iunrdx 29720 dvh4dimat 37248 mapdcv 37470 elrfirn 37784 fargshiftfo 41906 |
Copyright terms: Public domain | W3C validator |