| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > hfext | Structured version Visualization version GIF version | ||
| Description: Extensionality for HF sets depends only on comparison of HF elements. (Contributed by Scott Fenton, 16-Jul-2015.) |
| Ref | Expression |
|---|---|
| hfext | ⊢ ((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) → (𝐴 = 𝐵 ↔ ∀𝑥 ∈ HF (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfcleq 2753 | . . 3 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 2 | unvdif 4428 | . . . . 5 ⊢ ( HF ∪ (V ∖ HF )) = V | |
| 3 | 2 | raleqi 3317 | . . . 4 ⊢ (∀𝑥 ∈ ( HF ∪ (V ∖ HF ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ V (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 4 | ralv 3476 | . . . 4 ⊢ (∀𝑥 ∈ V (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 5 | 3, 4 | bitr2i 279 | . . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ ( HF ∪ (V ∖ HF ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 6 | ralunb 4195 | . . 3 ⊢ (∀𝑥 ∈ ( HF ∪ (V ∖ HF ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ (∀𝑥 ∈ HF (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ HF )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) | |
| 7 | 1, 5, 6 | 3bitri 300 | . 2 ⊢ (𝐴 = 𝐵 ↔ (∀𝑥 ∈ HF (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ HF )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) |
| 8 | vex 3454 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 9 | eldif 4049 | . . . . . 6 ⊢ (𝑥 ∈ (V ∖ HF ) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ HF )) | |
| 10 | 8, 9 | mpbiran 722 | . . . . 5 ⊢ (𝑥 ∈ (V ∖ HF ) ↔ ¬ 𝑥 ∈ HF ) |
| 11 | hfelhf 9915 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐴 ∈ HF ) → 𝑥 ∈ HF ) | |
| 12 | 11 | stoic1b 1805 | . . . . . . 7 ⊢ ((𝐴 ∈ HF ∧ ¬ 𝑥 ∈ HF ) → ¬ 𝑥 ∈ 𝐴) |
| 13 | 12 | adantlr 728 | . . . . . 6 ⊢ (((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) ∧ ¬ 𝑥 ∈ HF ) → ¬ 𝑥 ∈ 𝐴) |
| 14 | hfelhf 9915 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ HF ) → 𝑥 ∈ HF ) | |
| 15 | 14 | stoic1b 1805 | . . . . . . 7 ⊢ ((𝐵 ∈ HF ∧ ¬ 𝑥 ∈ HF ) → ¬ 𝑥 ∈ 𝐵) |
| 16 | 15 | adantll 727 | . . . . . 6 ⊢ (((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) ∧ ¬ 𝑥 ∈ HF ) → ¬ 𝑥 ∈ 𝐵) |
| 17 | 13, 16 | 2falsed 379 | . . . . 5 ⊢ (((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) ∧ ¬ 𝑥 ∈ HF ) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 18 | 10, 17 | sylan2b 606 | . . . 4 ⊢ (((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) ∧ 𝑥 ∈ (V ∖ HF )) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 19 | 18 | ralrimiva 3154 | . . 3 ⊢ ((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) → ∀𝑥 ∈ (V ∖ HF )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 20 | 19 | biantrud 541 | . 2 ⊢ ((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) → (∀𝑥 ∈ HF (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ (∀𝑥 ∈ HF (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ HF )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)))) |
| 21 | 7, 20 | bitr4id 293 | 1 ⊢ ((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) → (𝐴 = 𝐵 ↔ ∀𝑥 ∈ HF (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1567 = wceq 1569 ∈ wcel 2144 ∀wral 3076 Vcvv 3450 ∖ cdif 4045 ∪ cun 4149 HF chf 9905 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8300 df-wrecs 8331 df-recs 8380 df-rdg 8419 df-1o 8477 df-en 8975 df-dom 8976 df-fin 8978 df-r1 9769 df-rank 9770 df-hf 9906 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |