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 | vex 3176 | . . . . . 6 ⊢ 𝑥 ∈ V | |
2 | eldif 3550 | . . . . . 6 ⊢ (𝑥 ∈ (V ∖ Hf ) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ Hf )) | |
3 | 1, 2 | mpbiran 955 | . . . . 5 ⊢ (𝑥 ∈ (V ∖ Hf ) ↔ ¬ 𝑥 ∈ Hf ) |
4 | hfelhf 31458 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐴 ∈ Hf ) → 𝑥 ∈ Hf ) | |
5 | 4 | stoic1b 1689 | . . . . . . 7 ⊢ ((𝐴 ∈ Hf ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐴) |
6 | 5 | adantlr 747 | . . . . . 6 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐴) |
7 | hfelhf 31458 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ Hf ) → 𝑥 ∈ Hf ) | |
8 | 7 | stoic1b 1689 | . . . . . . 7 ⊢ ((𝐵 ∈ Hf ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐵) |
9 | 8 | adantll 746 | . . . . . 6 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ ¬ 𝑥 ∈ Hf ) → ¬ 𝑥 ∈ 𝐵) |
10 | 6, 9 | 2falsed 365 | . . . . 5 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ ¬ 𝑥 ∈ Hf ) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
11 | 3, 10 | sylan2b 491 | . . . 4 ⊢ (((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) ∧ 𝑥 ∈ (V ∖ Hf )) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
12 | 11 | ralrimiva 2949 | . . 3 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
13 | 12 | biantrud 527 | . 2 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)))) |
14 | dfcleq 2604 | . . 3 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
15 | unvdif 3994 | . . . . 5 ⊢ ( Hf ∪ (V ∖ Hf )) = V | |
16 | 15 | raleqi 3119 | . . . 4 ⊢ (∀𝑥 ∈ ( Hf ∪ (V ∖ Hf ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ V (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
17 | ralv 3192 | . . . 4 ⊢ (∀𝑥 ∈ V (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
18 | 16, 17 | bitr2i 264 | . . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑥 ∈ ( Hf ∪ (V ∖ Hf ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
19 | ralunb 3756 | . . 3 ⊢ (∀𝑥 ∈ ( Hf ∪ (V ∖ Hf ))(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) | |
20 | 14, 18, 19 | 3bitri 285 | . 2 ⊢ (𝐴 = 𝐵 ↔ (∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ∧ ∀𝑥 ∈ (V ∖ Hf )(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) |
21 | 13, 20 | syl6rbbr 278 | 1 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → (𝐴 = 𝐵 ↔ ∀𝑥 ∈ Hf (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 ∀wal 1473 = wceq 1475 ∈ wcel 1977 ∀wral 2896 Vcvv 3173 ∖ cdif 3537 ∪ cun 3538 Hf chf 31449 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-reg 8380 ax-inf2 8421 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-om 6958 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-r1 8510 df-rank 8511 df-hf 31450 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |