| 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 2756 | . . 3 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 2 | unvdif 4432 | . . . . 5 ⊢ ( HF ∪ (V ∖ HF )) = V | |
| 3 | 2 | raleqi 3321 | . . . 4 ⊢ (∀𝑥 ∈ ( HF ∪ (V ∖ HF ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ V (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 4 | ralv 3480 | . . . 4 ⊢ (∀𝑥 ∈ V (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 5 | 3, 4 | bitr2i 279 | . . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ ( HF ∪ (V ∖ HF ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 6 | ralunb 4198 | . . 3 ⊢ (∀𝑥 ∈ ( HF ∪ (V ∖ HF ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ (∀𝑥 ∈ HF (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ HF )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) | |
| 7 | 1, 5, 6 | 3bitri 300 | . 2 ⊢ (𝐴 = 𝐵 ↔ (∀𝑥 ∈ HF (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ HF )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) |
| 8 | vex 3458 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 9 | eldif 4052 | . . . . . 6 ⊢ (𝑥 ∈ (V ∖ HF ) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ HF )) | |
| 10 | 8, 9 | mpbiran 722 | . . . . 5 ⊢ (𝑥 ∈ (V ∖ HF ) ↔ ¬ 𝑥 ∈ HF ) |
| 11 | hfelhf 9941 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐴 ∈ HF ) → 𝑥 ∈ HF ) | |
| 12 | 11 | stoic1b 1806 | . . . . . . 7 ⊢ ((𝐴 ∈ HF ∧ ¬ 𝑥 ∈ HF ) → ¬ 𝑥 ∈ 𝐴) |
| 13 | 12 | adantlr 728 | . . . . . 6 ⊢ (((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) ∧ ¬ 𝑥 ∈ HF ) → ¬ 𝑥 ∈ 𝐴) |
| 14 | hfelhf 9941 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ HF ) → 𝑥 ∈ HF ) | |
| 15 | 14 | stoic1b 1806 | . . . . . . 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 3158 | . . 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 1568 = wceq 1570 ∈ wcel 2147 ∀wral 3080 Vcvv 3454 ∖ cdif 4048 ∪ cun 4152 HF chf 9931 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-ov 7446 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-en 9002 df-dom 9003 df-fin 9005 df-r1 9795 df-rank 9796 df-hf 9932 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |