| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Axiom of Union, reproved from conditionless ZFC axioms. |
| Ref | Expression |
|---|---|
| zfcndun | ⊢ ∃y∀z(∃w(z ∈ w ∧ w ∈ x) → z ∈ y) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axunnd 3742 | . 2 ⊢ ∃y∀z(∃y(z ∈ y ∧ y ∈ x) → z ∈ y) | |
| 2 | a14b 820 | . . . . . . 7 ⊢ (w = y → (z ∈ w ↔ z ∈ y)) | |
| 3 | a13b 819 | . . . . . . 7 ⊢ (w = y → (w ∈ x ↔ y ∈ x)) | |
| 4 | 2, 3 | anbi12d 476 | . . . . . 6 ⊢ (w = y → ((z ∈ w ∧ w ∈ x) ↔ (z ∈ y ∧ y ∈ x))) |
| 5 | 4 | cbvexv 973 | . . . . 5 ⊢ (∃w(z ∈ w ∧ w ∈ x) ↔ ∃y(z ∈ y ∧ y ∈ x)) |
| 6 | 5 | imbi1i 161 | . . . 4 ⊢ ((∃w(z ∈ w ∧ w ∈ x) → z ∈ y) ↔ (∃y(z ∈ y ∧ y ∈ x) → z ∈ y)) |
| 7 | 6 | bial 695 | . . 3 ⊢ (∀z(∃w(z ∈ w ∧ w ∈ x) → z ∈ y) ↔ ∀z(∃y(z ∈ y ∧ y ∈ x) → z ∈ y)) |
| 8 | 7 | biex 733 | . 2 ⊢ (∃y∀z(∃w(z ∈ w ∧ w ∈ x) → z ∈ y) ↔ ∃y∀z(∃y(z ∈ y ∧ y ∈ x) → z ∈ y)) |
| 9 | 1, 8 | mpbir 165 | 1 ⊢ ∃y∀z(∃w(z ∈ w ∧ w ∈ x) → z ∈ y) |
| Colors of variables: wff set class |
| Syntax hints: → wi 2 ∧ wa 196 ∀wal 672 ∃wex 678 = weq 797 ∈ wel 803 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-un 1076 ax-pow 1077 ax-reg 1078 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-ral 1205 df-rex 1206 df-v 1349 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-nul 1708 df-pw 1799 df-sn 1811 df-pr 1812 df-op 1815 df-br 2063 df-opab 2098 df-eprel 2122 df-fr 2169 |