Users' Mathboxes Mathbox for Jeff Hankins < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fnejoin2 Structured version   Visualization version   GIF version

Theorem fnejoin2 34841
Description: Join of equivalence classes under the fineness relation-part two. (Contributed by Jeff Hankins, 8-Oct-2009.) (Proof shortened by Mario Carneiro, 12-Sep-2015.)
Assertion
Ref Expression
fnejoin2 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → (if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇 ↔ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)))
Distinct variable groups:   𝑥,𝑦,𝑆   𝑥,𝑉   𝑥,𝑋,𝑦   𝑥,𝑇
Allowed substitution hints:   𝑇(𝑦)   𝑉(𝑦)

Proof of Theorem fnejoin2
StepHypRef Expression
1 unisng 4886 . . . . . . . . 9 (𝑋𝑉 {𝑋} = 𝑋)
21eqcomd 2742 . . . . . . . 8 (𝑋𝑉𝑋 = {𝑋})
32adantr 481 . . . . . . 7 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → 𝑋 = {𝑋})
4 iftrue 4492 . . . . . . . . 9 (𝑆 = ∅ → if(𝑆 = ∅, {𝑋}, 𝑆) = {𝑋})
54unieqd 4879 . . . . . . . 8 (𝑆 = ∅ → if(𝑆 = ∅, {𝑋}, 𝑆) = {𝑋})
65eqeq2d 2747 . . . . . . 7 (𝑆 = ∅ → (𝑋 = if(𝑆 = ∅, {𝑋}, 𝑆) ↔ 𝑋 = {𝑋}))
73, 6syl5ibrcom 246 . . . . . 6 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → (𝑆 = ∅ → 𝑋 = if(𝑆 = ∅, {𝑋}, 𝑆)))
8 n0 4306 . . . . . . 7 (𝑆 ≠ ∅ ↔ ∃𝑥 𝑥𝑆)
9 unieq 4876 . . . . . . . . . . . . 13 (𝑦 = 𝑥 𝑦 = 𝑥)
109eqeq2d 2747 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝑋 = 𝑦𝑋 = 𝑥))
1110rspccva 3580 . . . . . . . . . . 11 ((∀𝑦𝑆 𝑋 = 𝑦𝑥𝑆) → 𝑋 = 𝑥)
12113adant1 1130 . . . . . . . . . 10 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦𝑥𝑆) → 𝑋 = 𝑥)
13 fnejoin1 34840 . . . . . . . . . . 11 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦𝑥𝑆) → 𝑥Fneif(𝑆 = ∅, {𝑋}, 𝑆))
14 eqid 2736 . . . . . . . . . . . 12 𝑥 = 𝑥
15 eqid 2736 . . . . . . . . . . . 12 if(𝑆 = ∅, {𝑋}, 𝑆) = if(𝑆 = ∅, {𝑋}, 𝑆)
1614, 15fnebas 34816 . . . . . . . . . . 11 (𝑥Fneif(𝑆 = ∅, {𝑋}, 𝑆) → 𝑥 = if(𝑆 = ∅, {𝑋}, 𝑆))
1713, 16syl 17 . . . . . . . . . 10 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦𝑥𝑆) → 𝑥 = if(𝑆 = ∅, {𝑋}, 𝑆))
1812, 17eqtrd 2776 . . . . . . . . 9 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦𝑥𝑆) → 𝑋 = if(𝑆 = ∅, {𝑋}, 𝑆))
19183expia 1121 . . . . . . . 8 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → (𝑥𝑆𝑋 = if(𝑆 = ∅, {𝑋}, 𝑆)))
2019exlimdv 1936 . . . . . . 7 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → (∃𝑥 𝑥𝑆𝑋 = if(𝑆 = ∅, {𝑋}, 𝑆)))
218, 20biimtrid 241 . . . . . 6 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → (𝑆 ≠ ∅ → 𝑋 = if(𝑆 = ∅, {𝑋}, 𝑆)))
227, 21pm2.61dne 3031 . . . . 5 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → 𝑋 = if(𝑆 = ∅, {𝑋}, 𝑆))
23 eqid 2736 . . . . . 6 𝑇 = 𝑇
2415, 23fnebas 34816 . . . . 5 (if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇 if(𝑆 = ∅, {𝑋}, 𝑆) = 𝑇)
2522, 24sylan9eq 2796 . . . 4 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇) → 𝑋 = 𝑇)
2625ex 413 . . 3 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → (if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇𝑋 = 𝑇))
27 fnetr 34823 . . . . . . 7 ((𝑥Fneif(𝑆 = ∅, {𝑋}, 𝑆) ∧ if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇) → 𝑥Fne𝑇)
2827ex 413 . . . . . 6 (𝑥Fneif(𝑆 = ∅, {𝑋}, 𝑆) → (if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇𝑥Fne𝑇))
2913, 28syl 17 . . . . 5 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦𝑥𝑆) → (if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇𝑥Fne𝑇))
30293expa 1118 . . . 4 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ 𝑥𝑆) → (if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇𝑥Fne𝑇))
3130ralrimdva 3151 . . 3 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → (if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇 → ∀𝑥𝑆 𝑥Fne𝑇))
3226, 31jcad 513 . 2 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → (if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇 → (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)))
3322adantr 481 . . . . 5 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) → 𝑋 = if(𝑆 = ∅, {𝑋}, 𝑆))
34 simprl 769 . . . . 5 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) → 𝑋 = 𝑇)
3533, 34eqtr3d 2778 . . . 4 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) → if(𝑆 = ∅, {𝑋}, 𝑆) = 𝑇)
36 sseq1 3969 . . . . 5 ({𝑋} = if(𝑆 = ∅, {𝑋}, 𝑆) → ({𝑋} ⊆ (topGen‘𝑇) ↔ if(𝑆 = ∅, {𝑋}, 𝑆) ⊆ (topGen‘𝑇)))
37 sseq1 3969 . . . . 5 ( 𝑆 = if(𝑆 = ∅, {𝑋}, 𝑆) → ( 𝑆 ⊆ (topGen‘𝑇) ↔ if(𝑆 = ∅, {𝑋}, 𝑆) ⊆ (topGen‘𝑇)))
38 elex 3463 . . . . . . . . . . . 12 (𝑋𝑉𝑋 ∈ V)
3938ad2antrr 724 . . . . . . . . . . 11 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) → 𝑋 ∈ V)
4034, 39eqeltrrd 2839 . . . . . . . . . 10 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) → 𝑇 ∈ V)
41 uniexb 7698 . . . . . . . . . 10 (𝑇 ∈ V ↔ 𝑇 ∈ V)
4240, 41sylibr 233 . . . . . . . . 9 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) → 𝑇 ∈ V)
43 ssid 3966 . . . . . . . . 9 𝑇𝑇
44 eltg3i 22311 . . . . . . . . 9 ((𝑇 ∈ V ∧ 𝑇𝑇) → 𝑇 ∈ (topGen‘𝑇))
4542, 43, 44sylancl 586 . . . . . . . 8 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) → 𝑇 ∈ (topGen‘𝑇))
4634, 45eqeltrd 2838 . . . . . . 7 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) → 𝑋 ∈ (topGen‘𝑇))
4746snssd 4769 . . . . . 6 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) → {𝑋} ⊆ (topGen‘𝑇))
4847adantr 481 . . . . 5 ((((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) ∧ 𝑆 = ∅) → {𝑋} ⊆ (topGen‘𝑇))
49 simplrr 776 . . . . . . 7 ((((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) ∧ ¬ 𝑆 = ∅) → ∀𝑥𝑆 𝑥Fne𝑇)
50 fnetg 34817 . . . . . . . 8 (𝑥Fne𝑇𝑥 ⊆ (topGen‘𝑇))
5150ralimi 3086 . . . . . . 7 (∀𝑥𝑆 𝑥Fne𝑇 → ∀𝑥𝑆 𝑥 ⊆ (topGen‘𝑇))
5249, 51syl 17 . . . . . 6 ((((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) ∧ ¬ 𝑆 = ∅) → ∀𝑥𝑆 𝑥 ⊆ (topGen‘𝑇))
53 unissb 4900 . . . . . 6 ( 𝑆 ⊆ (topGen‘𝑇) ↔ ∀𝑥𝑆 𝑥 ⊆ (topGen‘𝑇))
5452, 53sylibr 233 . . . . 5 ((((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) ∧ ¬ 𝑆 = ∅) → 𝑆 ⊆ (topGen‘𝑇))
5536, 37, 48, 54ifbothda 4524 . . . 4 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) → if(𝑆 = ∅, {𝑋}, 𝑆) ⊆ (topGen‘𝑇))
5615, 23isfne4 34812 . . . 4 (if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇 ↔ ( if(𝑆 = ∅, {𝑋}, 𝑆) = 𝑇 ∧ if(𝑆 = ∅, {𝑋}, 𝑆) ⊆ (topGen‘𝑇)))
5735, 55, 56sylanbrc 583 . . 3 (((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) ∧ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)) → if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇)
5857ex 413 . 2 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → ((𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇) → if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇))
5932, 58impbid 211 1 ((𝑋𝑉 ∧ ∀𝑦𝑆 𝑋 = 𝑦) → (if(𝑆 = ∅, {𝑋}, 𝑆)Fne𝑇 ↔ (𝑋 = 𝑇 ∧ ∀𝑥𝑆 𝑥Fne𝑇)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wex 1781  wcel 2106  wne 2943  wral 3064  Vcvv 3445  wss 3910  c0 4282  ifcif 4486  {csn 4586   cuni 4865   class class class wbr 5105  cfv 6496  topGenctg 17319  Fnecfne 34808
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-iota 6448  df-fun 6498  df-fv 6504  df-topgen 17325  df-fne 34809
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator