| 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 2733 | . . 3 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 2 | unvdif 4410 | . . . . 5 ⊢ ( Hf ∪ (V ∖ Hf )) = V | |
| 3 | 2 | raleqi 3296 | . . . 4 ⊢ (∀𝑥 ∈ ( Hf ∪ (V ∖ Hf ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ V (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 4 | ralv 3459 | . . . 4 ⊢ (∀𝑥 ∈ V (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 5 | 3, 4 | bitr2i 277 | . . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ ( Hf ∪ (V ∖ Hf ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 6 | ralunb 4133 | . . 3 ⊢ (∀𝑥 ∈ ( Hf ∪ (V ∖ Hf ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) | |
| 7 | 1, 5, 6 | 3bitri 298 | . 2 ⊢ (𝐴 = 𝐵 ↔ (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) |
| 8 | vex 3436 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 9 | eldif 3900 | . . . . . 6 ⊢ (𝑥 ∈ (V ∖ Hf ) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ Hf )) | |
| 10 | 8, 9 | mpbiran 715 | . . . . 5 ⊢ (𝑥 ∈ (V ∖ Hf ) ↔ ¬ 𝑥 ∈ Hf ) |
| 11 | hfelhf 36410 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐴 ∈ Hf ) → 𝑥 ∈ Hf ) | |
| 12 | 11 | stoic1b 1780 | . . . . . . 7 ⊢ ((𝐴 ∈ Hf ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐴) |
| 13 | 12 | adantlr 721 | . . . . . 6 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐴) |
| 14 | hfelhf 36410 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ Hf ) → 𝑥 ∈ Hf ) | |
| 15 | 14 | stoic1b 1780 | . . . . . . 7 ⊢ ((𝐵 ∈ Hf ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐵) |
| 16 | 15 | adantll 720 | . . . . . 6 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐵) |
| 17 | 13, 16 | 2falsed 377 | . . . . 5 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ ¬ 𝑥 ∈ Hf ) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 18 | 10, 17 | sylan2b 600 | . . . 4 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ 𝑥 ∈ (V ∖ Hf )) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 19 | 18 | ralrimiva 3132 | . . 3 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 20 | 19 | biantrud 536 | . 2 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)))) |
| 21 | 7, 20 | bitr4id 291 | 1 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → (𝐴 = 𝐵 ↔ ∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∀wal 1545 = wceq 1547 ∈ wcel 2119 ∀wral 3054 Vcvv 3432 ∖ cdif 3887 ∪ cun 3888 Hf chf 36401 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-reg 9504 ax-inf2 9560 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-int 4885 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7366 df-om 7814 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-r1 9686 df-rank 9687 df-hf 36402 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |