MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ordtbas Structured version   Visualization version   GIF version

Theorem ordtbas 21044
Description: In a total order, the finite intersections of the open rays generates the set of open intervals, but no more - these four collections form a subbasis for the order topology. (Contributed by Mario Carneiro, 3-Sep-2015.)
Hypotheses
Ref Expression
ordtval.1 𝑋 = dom 𝑅
ordtval.2 𝐴 = ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥})
ordtval.3 𝐵 = ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦})
ordtval.4 𝐶 = ran (𝑎𝑋, 𝑏𝑋 ↦ {𝑦𝑋 ∣ (¬ 𝑦𝑅𝑎 ∧ ¬ 𝑏𝑅𝑦)})
Assertion
Ref Expression
ordtbas (𝑅 ∈ TosetRel → (fi‘({𝑋} ∪ (𝐴𝐵))) = (({𝑋} ∪ (𝐴𝐵)) ∪ 𝐶))
Distinct variable groups:   𝑎,𝑏,𝐴   𝑥,𝑎,𝑦,𝑅,𝑏   𝑋,𝑎,𝑏,𝑥,𝑦   𝐵,𝑎,𝑏
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦,𝑎,𝑏)

Proof of Theorem ordtbas
Dummy variables 𝑚 𝑛 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snex 4938 . . . . . 6 {𝑋} ∈ V
2 ssun2 3810 . . . . . . 7 (𝐴𝐵) ⊆ ({𝑋} ∪ (𝐴𝐵))
3 ordtval.1 . . . . . . . . . 10 𝑋 = dom 𝑅
4 ordtval.2 . . . . . . . . . 10 𝐴 = ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥})
5 ordtval.3 . . . . . . . . . 10 𝐵 = ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦})
63, 4, 5ordtuni 21042 . . . . . . . . 9 (𝑅 ∈ TosetRel → 𝑋 = ({𝑋} ∪ (𝐴𝐵)))
7 dmexg 7139 . . . . . . . . . 10 (𝑅 ∈ TosetRel → dom 𝑅 ∈ V)
83, 7syl5eqel 2734 . . . . . . . . 9 (𝑅 ∈ TosetRel → 𝑋 ∈ V)
96, 8eqeltrrd 2731 . . . . . . . 8 (𝑅 ∈ TosetRel → ({𝑋} ∪ (𝐴𝐵)) ∈ V)
10 uniexb 7015 . . . . . . . 8 (({𝑋} ∪ (𝐴𝐵)) ∈ V ↔ ({𝑋} ∪ (𝐴𝐵)) ∈ V)
119, 10sylibr 224 . . . . . . 7 (𝑅 ∈ TosetRel → ({𝑋} ∪ (𝐴𝐵)) ∈ V)
12 ssexg 4837 . . . . . . 7 (((𝐴𝐵) ⊆ ({𝑋} ∪ (𝐴𝐵)) ∧ ({𝑋} ∪ (𝐴𝐵)) ∈ V) → (𝐴𝐵) ∈ V)
132, 11, 12sylancr 696 . . . . . 6 (𝑅 ∈ TosetRel → (𝐴𝐵) ∈ V)
14 elfiun 8377 . . . . . 6 (({𝑋} ∈ V ∧ (𝐴𝐵) ∈ V) → (𝑧 ∈ (fi‘({𝑋} ∪ (𝐴𝐵))) ↔ (𝑧 ∈ (fi‘{𝑋}) ∨ 𝑧 ∈ (fi‘(𝐴𝐵)) ∨ ∃𝑚 ∈ (fi‘{𝑋})∃𝑛 ∈ (fi‘(𝐴𝐵))𝑧 = (𝑚𝑛))))
151, 13, 14sylancr 696 . . . . 5 (𝑅 ∈ TosetRel → (𝑧 ∈ (fi‘({𝑋} ∪ (𝐴𝐵))) ↔ (𝑧 ∈ (fi‘{𝑋}) ∨ 𝑧 ∈ (fi‘(𝐴𝐵)) ∨ ∃𝑚 ∈ (fi‘{𝑋})∃𝑛 ∈ (fi‘(𝐴𝐵))𝑧 = (𝑚𝑛))))
16 fisn 8374 . . . . . . . . 9 (fi‘{𝑋}) = {𝑋}
17 ssun1 3809 . . . . . . . . 9 {𝑋} ⊆ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶))
1816, 17eqsstri 3668 . . . . . . . 8 (fi‘{𝑋}) ⊆ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶))
1918sseli 3632 . . . . . . 7 (𝑧 ∈ (fi‘{𝑋}) → 𝑧 ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶)))
2019a1i 11 . . . . . 6 (𝑅 ∈ TosetRel → (𝑧 ∈ (fi‘{𝑋}) → 𝑧 ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶))))
21 ordtval.4 . . . . . . . . 9 𝐶 = ran (𝑎𝑋, 𝑏𝑋 ↦ {𝑦𝑋 ∣ (¬ 𝑦𝑅𝑎 ∧ ¬ 𝑏𝑅𝑦)})
223, 4, 5, 21ordtbas2 21043 . . . . . . . 8 (𝑅 ∈ TosetRel → (fi‘(𝐴𝐵)) = ((𝐴𝐵) ∪ 𝐶))
23 ssun2 3810 . . . . . . . 8 ((𝐴𝐵) ∪ 𝐶) ⊆ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶))
2422, 23syl6eqss 3688 . . . . . . 7 (𝑅 ∈ TosetRel → (fi‘(𝐴𝐵)) ⊆ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶)))
2524sseld 3635 . . . . . 6 (𝑅 ∈ TosetRel → (𝑧 ∈ (fi‘(𝐴𝐵)) → 𝑧 ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶))))
26 fipwuni 8373 . . . . . . . . . . . . . . 15 (fi‘(𝐴𝐵)) ⊆ 𝒫 (𝐴𝐵)
2726sseli 3632 . . . . . . . . . . . . . 14 (𝑛 ∈ (fi‘(𝐴𝐵)) → 𝑛 ∈ 𝒫 (𝐴𝐵))
2827elpwid 4203 . . . . . . . . . . . . 13 (𝑛 ∈ (fi‘(𝐴𝐵)) → 𝑛 (𝐴𝐵))
2928ad2antll 765 . . . . . . . . . . . 12 ((𝑅 ∈ TosetRel ∧ (𝑚 ∈ (fi‘{𝑋}) ∧ 𝑛 ∈ (fi‘(𝐴𝐵)))) → 𝑛 (𝐴𝐵))
302unissi 4493 . . . . . . . . . . . . . 14 (𝐴𝐵) ⊆ ({𝑋} ∪ (𝐴𝐵))
3130, 6syl5sseqr 3687 . . . . . . . . . . . . 13 (𝑅 ∈ TosetRel → (𝐴𝐵) ⊆ 𝑋)
3231adantr 480 . . . . . . . . . . . 12 ((𝑅 ∈ TosetRel ∧ (𝑚 ∈ (fi‘{𝑋}) ∧ 𝑛 ∈ (fi‘(𝐴𝐵)))) → (𝐴𝐵) ⊆ 𝑋)
3329, 32sstrd 3646 . . . . . . . . . . 11 ((𝑅 ∈ TosetRel ∧ (𝑚 ∈ (fi‘{𝑋}) ∧ 𝑛 ∈ (fi‘(𝐴𝐵)))) → 𝑛𝑋)
34 simprl 809 . . . . . . . . . . . . 13 ((𝑅 ∈ TosetRel ∧ (𝑚 ∈ (fi‘{𝑋}) ∧ 𝑛 ∈ (fi‘(𝐴𝐵)))) → 𝑚 ∈ (fi‘{𝑋}))
3534, 16syl6eleq 2740 . . . . . . . . . . . 12 ((𝑅 ∈ TosetRel ∧ (𝑚 ∈ (fi‘{𝑋}) ∧ 𝑛 ∈ (fi‘(𝐴𝐵)))) → 𝑚 ∈ {𝑋})
36 elsni 4227 . . . . . . . . . . . 12 (𝑚 ∈ {𝑋} → 𝑚 = 𝑋)
3735, 36syl 17 . . . . . . . . . . 11 ((𝑅 ∈ TosetRel ∧ (𝑚 ∈ (fi‘{𝑋}) ∧ 𝑛 ∈ (fi‘(𝐴𝐵)))) → 𝑚 = 𝑋)
3833, 37sseqtr4d 3675 . . . . . . . . . 10 ((𝑅 ∈ TosetRel ∧ (𝑚 ∈ (fi‘{𝑋}) ∧ 𝑛 ∈ (fi‘(𝐴𝐵)))) → 𝑛𝑚)
39 sseqin2 3850 . . . . . . . . . 10 (𝑛𝑚 ↔ (𝑚𝑛) = 𝑛)
4038, 39sylib 208 . . . . . . . . 9 ((𝑅 ∈ TosetRel ∧ (𝑚 ∈ (fi‘{𝑋}) ∧ 𝑛 ∈ (fi‘(𝐴𝐵)))) → (𝑚𝑛) = 𝑛)
4124sselda 3636 . . . . . . . . . 10 ((𝑅 ∈ TosetRel ∧ 𝑛 ∈ (fi‘(𝐴𝐵))) → 𝑛 ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶)))
4241adantrl 752 . . . . . . . . 9 ((𝑅 ∈ TosetRel ∧ (𝑚 ∈ (fi‘{𝑋}) ∧ 𝑛 ∈ (fi‘(𝐴𝐵)))) → 𝑛 ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶)))
4340, 42eqeltrd 2730 . . . . . . . 8 ((𝑅 ∈ TosetRel ∧ (𝑚 ∈ (fi‘{𝑋}) ∧ 𝑛 ∈ (fi‘(𝐴𝐵)))) → (𝑚𝑛) ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶)))
44 eleq1 2718 . . . . . . . 8 (𝑧 = (𝑚𝑛) → (𝑧 ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶)) ↔ (𝑚𝑛) ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶))))
4543, 44syl5ibrcom 237 . . . . . . 7 ((𝑅 ∈ TosetRel ∧ (𝑚 ∈ (fi‘{𝑋}) ∧ 𝑛 ∈ (fi‘(𝐴𝐵)))) → (𝑧 = (𝑚𝑛) → 𝑧 ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶))))
4645rexlimdvva 3067 . . . . . 6 (𝑅 ∈ TosetRel → (∃𝑚 ∈ (fi‘{𝑋})∃𝑛 ∈ (fi‘(𝐴𝐵))𝑧 = (𝑚𝑛) → 𝑧 ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶))))
4720, 25, 463jaod 1432 . . . . 5 (𝑅 ∈ TosetRel → ((𝑧 ∈ (fi‘{𝑋}) ∨ 𝑧 ∈ (fi‘(𝐴𝐵)) ∨ ∃𝑚 ∈ (fi‘{𝑋})∃𝑛 ∈ (fi‘(𝐴𝐵))𝑧 = (𝑚𝑛)) → 𝑧 ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶))))
4815, 47sylbid 230 . . . 4 (𝑅 ∈ TosetRel → (𝑧 ∈ (fi‘({𝑋} ∪ (𝐴𝐵))) → 𝑧 ∈ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶))))
4948ssrdv 3642 . . 3 (𝑅 ∈ TosetRel → (fi‘({𝑋} ∪ (𝐴𝐵))) ⊆ ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶)))
50 ssfii 8366 . . . . . 6 (({𝑋} ∪ (𝐴𝐵)) ∈ V → ({𝑋} ∪ (𝐴𝐵)) ⊆ (fi‘({𝑋} ∪ (𝐴𝐵))))
5111, 50syl 17 . . . . 5 (𝑅 ∈ TosetRel → ({𝑋} ∪ (𝐴𝐵)) ⊆ (fi‘({𝑋} ∪ (𝐴𝐵))))
5251unssad 3823 . . . 4 (𝑅 ∈ TosetRel → {𝑋} ⊆ (fi‘({𝑋} ∪ (𝐴𝐵))))
53 fiss 8371 . . . . . 6 ((({𝑋} ∪ (𝐴𝐵)) ∈ V ∧ (𝐴𝐵) ⊆ ({𝑋} ∪ (𝐴𝐵))) → (fi‘(𝐴𝐵)) ⊆ (fi‘({𝑋} ∪ (𝐴𝐵))))
5411, 2, 53sylancl 695 . . . . 5 (𝑅 ∈ TosetRel → (fi‘(𝐴𝐵)) ⊆ (fi‘({𝑋} ∪ (𝐴𝐵))))
5522, 54eqsstr3d 3673 . . . 4 (𝑅 ∈ TosetRel → ((𝐴𝐵) ∪ 𝐶) ⊆ (fi‘({𝑋} ∪ (𝐴𝐵))))
5652, 55unssd 3822 . . 3 (𝑅 ∈ TosetRel → ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶)) ⊆ (fi‘({𝑋} ∪ (𝐴𝐵))))
5749, 56eqssd 3653 . 2 (𝑅 ∈ TosetRel → (fi‘({𝑋} ∪ (𝐴𝐵))) = ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶)))
58 unass 3803 . 2 (({𝑋} ∪ (𝐴𝐵)) ∪ 𝐶) = ({𝑋} ∪ ((𝐴𝐵) ∪ 𝐶))
5957, 58syl6eqr 2703 1 (𝑅 ∈ TosetRel → (fi‘({𝑋} ∪ (𝐴𝐵))) = (({𝑋} ∪ (𝐴𝐵)) ∪ 𝐶))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 383  w3o 1053   = wceq 1523  wcel 2030  wrex 2942  {crab 2945  Vcvv 3231  cun 3605  cin 3606  wss 3607  𝒫 cpw 4191  {csn 4210   cuni 4468   class class class wbr 4685  cmpt 4762  dom cdm 5143  ran crn 5144  cfv 5926  cmpt2 6692  ficfi 8357   TosetRel ctsr 17246
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-oadd 7609  df-er 7787  df-en 7998  df-fin 8001  df-fi 8358  df-ps 17247  df-tsr 17248
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator