![]() |
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 2726 | . . 3 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
2 | unvdif 4438 | . . . . 5 ⊢ ( Hf ∪ (V ∖ Hf )) = V | |
3 | 2 | raleqi 3310 | . . . 4 ⊢ (∀𝑥 ∈ ( Hf ∪ (V ∖ Hf ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ V (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
4 | ralv 3471 | . . . 4 ⊢ (∀𝑥 ∈ V (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
5 | 3, 4 | bitr2i 276 | . . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ ( Hf ∪ (V ∖ Hf ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
6 | ralunb 4155 | . . 3 ⊢ (∀𝑥 ∈ ( Hf ∪ (V ∖ Hf ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) | |
7 | 1, 5, 6 | 3bitri 297 | . 2 ⊢ (𝐴 = 𝐵 ↔ (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) |
8 | vex 3451 | . . . . . 6 ⊢ 𝑥 ∈ V | |
9 | eldif 3924 | . . . . . 6 ⊢ (𝑥 ∈ (V ∖ Hf ) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ Hf )) | |
10 | 8, 9 | mpbiran 708 | . . . . 5 ⊢ (𝑥 ∈ (V ∖ Hf ) ↔ ¬ 𝑥 ∈ Hf ) |
11 | hfelhf 34819 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐴 ∈ Hf ) → 𝑥 ∈ Hf ) | |
12 | 11 | stoic1b 1776 | . . . . . . 7 ⊢ ((𝐴 ∈ Hf ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐴) |
13 | 12 | adantlr 714 | . . . . . 6 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐴) |
14 | hfelhf 34819 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ Hf ) → 𝑥 ∈ Hf ) | |
15 | 14 | stoic1b 1776 | . . . . . . 7 ⊢ ((𝐵 ∈ Hf ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐵) |
16 | 15 | adantll 713 | . . . . . 6 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐵) |
17 | 13, 16 | 2falsed 377 | . . . . 5 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ ¬ 𝑥 ∈ Hf ) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
18 | 10, 17 | sylan2b 595 | . . . 4 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ 𝑥 ∈ (V ∖ Hf )) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
19 | 18 | ralrimiva 3140 | . . 3 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
20 | 19 | biantrud 533 | . 2 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)))) |
21 | 7, 20 | bitr4id 290 | 1 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → (𝐴 = 𝐵 ↔ ∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 ∀wal 1540 = wceq 1542 ∈ wcel 2107 ∀wral 3061 Vcvv 3447 ∖ cdif 3911 ∪ cun 3912 Hf chf 34810 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5246 ax-sep 5260 ax-nul 5267 ax-pow 5324 ax-pr 5388 ax-un 7676 ax-reg 9536 ax-inf2 9585 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3353 df-rab 3407 df-v 3449 df-sbc 3744 df-csb 3860 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3933 df-nul 4287 df-if 4491 df-pw 4566 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4870 df-int 4912 df-iun 4960 df-br 5110 df-opab 5172 df-mpt 5193 df-tr 5227 df-id 5535 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5592 df-we 5594 df-xp 5643 df-rel 5644 df-cnv 5645 df-co 5646 df-dm 5647 df-rn 5648 df-res 5649 df-ima 5650 df-pred 6257 df-ord 6324 df-on 6325 df-lim 6326 df-suc 6327 df-iota 6452 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7364 df-om 7807 df-2nd 7926 df-frecs 8216 df-wrecs 8247 df-recs 8321 df-rdg 8360 df-er 8654 df-en 8890 df-dom 8891 df-sdom 8892 df-r1 9708 df-rank 9709 df-hf 34811 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |