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 320 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (¬ 𝜓 ↔ ¬ 𝜒)) |
5 | 1, 2, 4 | ralxfrd 5311 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ¬ 𝜓 ↔ ∀𝑦 ∈ 𝐶 ¬ 𝜒)) |
6 | 5 | notbid 320 | . 2 ⊢ (𝜑 → (¬ ∀𝑥 ∈ 𝐵 ¬ 𝜓 ↔ ¬ ∀𝑦 ∈ 𝐶 ¬ 𝜒)) |
7 | dfrex2 3241 | . 2 ⊢ (∃𝑥 ∈ 𝐵 𝜓 ↔ ¬ ∀𝑥 ∈ 𝐵 ¬ 𝜓) | |
8 | dfrex2 3241 | . 2 ⊢ (∃𝑦 ∈ 𝐶 𝜒 ↔ ¬ ∀𝑦 ∈ 𝐶 ¬ 𝜒) | |
9 | 6, 7, 8 | 3bitr4g 316 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 𝜓 ↔ ∃𝑦 ∈ 𝐶 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∀wral 3140 ∃wrex 3141 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1781 df-cleq 2816 df-clel 2895 df-ral 3145 df-rex 3146 |
This theorem is referenced by: cmpfi 22018 elfm 22557 rlimcnp 25545 rmoxfrd 30259 iunrdx 30317 swrdrn3 30631 dvh4dimat 38576 mapdcv 38798 elrfirn 39299 fargshiftfo 43609 |
Copyright terms: Public domain | W3C validator |