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

Theorem ordtuni 20994
Description: Value of the order topology. (Contributed by Mario Carneiro, 3-Sep-2015.)
Hypotheses
Ref Expression
ordtval.1 𝑋 = dom 𝑅
ordtval.2 𝐴 = ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥})
ordtval.3 𝐵 = ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦})
Assertion
Ref Expression
ordtuni (𝑅𝑉𝑋 = ({𝑋} ∪ (𝐴𝐵)))
Distinct variable groups:   𝑥,𝑦,𝑅   𝑥,𝑋,𝑦   𝑥,𝑉
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝑉(𝑦)

Proof of Theorem ordtuni
StepHypRef Expression
1 ordtval.1 . . . . . 6 𝑋 = dom 𝑅
2 dmexg 7097 . . . . . 6 (𝑅𝑉 → dom 𝑅 ∈ V)
31, 2syl5eqel 2705 . . . . 5 (𝑅𝑉𝑋 ∈ V)
4 unisng 4452 . . . . 5 (𝑋 ∈ V → {𝑋} = 𝑋)
53, 4syl 17 . . . 4 (𝑅𝑉 {𝑋} = 𝑋)
65uneq1d 3766 . . 3 (𝑅𝑉 → ( {𝑋} ∪ (𝐴𝐵)) = (𝑋 (𝐴𝐵)))
7 ordtval.2 . . . . . . 7 𝐴 = ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥})
8 ssrab2 3687 . . . . . . . . . 10 {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥} ⊆ 𝑋
93adantr 481 . . . . . . . . . . 11 ((𝑅𝑉𝑥𝑋) → 𝑋 ∈ V)
10 elpw2g 4827 . . . . . . . . . . 11 (𝑋 ∈ V → ({𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥} ∈ 𝒫 𝑋 ↔ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥} ⊆ 𝑋))
119, 10syl 17 . . . . . . . . . 10 ((𝑅𝑉𝑥𝑋) → ({𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥} ∈ 𝒫 𝑋 ↔ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥} ⊆ 𝑋))
128, 11mpbiri 248 . . . . . . . . 9 ((𝑅𝑉𝑥𝑋) → {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥} ∈ 𝒫 𝑋)
13 eqid 2622 . . . . . . . . 9 (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥}) = (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥})
1412, 13fmptd 6385 . . . . . . . 8 (𝑅𝑉 → (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥}):𝑋⟶𝒫 𝑋)
15 frn 6053 . . . . . . . 8 ((𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥}):𝑋⟶𝒫 𝑋 → ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥}) ⊆ 𝒫 𝑋)
1614, 15syl 17 . . . . . . 7 (𝑅𝑉 → ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑦𝑅𝑥}) ⊆ 𝒫 𝑋)
177, 16syl5eqss 3649 . . . . . 6 (𝑅𝑉𝐴 ⊆ 𝒫 𝑋)
18 ordtval.3 . . . . . . 7 𝐵 = ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦})
19 ssrab2 3687 . . . . . . . . . 10 {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦} ⊆ 𝑋
20 elpw2g 4827 . . . . . . . . . . 11 (𝑋 ∈ V → ({𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦} ∈ 𝒫 𝑋 ↔ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦} ⊆ 𝑋))
219, 20syl 17 . . . . . . . . . 10 ((𝑅𝑉𝑥𝑋) → ({𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦} ∈ 𝒫 𝑋 ↔ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦} ⊆ 𝑋))
2219, 21mpbiri 248 . . . . . . . . 9 ((𝑅𝑉𝑥𝑋) → {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦} ∈ 𝒫 𝑋)
23 eqid 2622 . . . . . . . . 9 (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦}) = (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦})
2422, 23fmptd 6385 . . . . . . . 8 (𝑅𝑉 → (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦}):𝑋⟶𝒫 𝑋)
25 frn 6053 . . . . . . . 8 ((𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦}):𝑋⟶𝒫 𝑋 → ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦}) ⊆ 𝒫 𝑋)
2624, 25syl 17 . . . . . . 7 (𝑅𝑉 → ran (𝑥𝑋 ↦ {𝑦𝑋 ∣ ¬ 𝑥𝑅𝑦}) ⊆ 𝒫 𝑋)
2718, 26syl5eqss 3649 . . . . . 6 (𝑅𝑉𝐵 ⊆ 𝒫 𝑋)
2817, 27unssd 3789 . . . . 5 (𝑅𝑉 → (𝐴𝐵) ⊆ 𝒫 𝑋)
29 sspwuni 4611 . . . . 5 ((𝐴𝐵) ⊆ 𝒫 𝑋 (𝐴𝐵) ⊆ 𝑋)
3028, 29sylib 208 . . . 4 (𝑅𝑉 (𝐴𝐵) ⊆ 𝑋)
31 ssequn2 3786 . . . 4 ( (𝐴𝐵) ⊆ 𝑋 ↔ (𝑋 (𝐴𝐵)) = 𝑋)
3230, 31sylib 208 . . 3 (𝑅𝑉 → (𝑋 (𝐴𝐵)) = 𝑋)
336, 32eqtr2d 2657 . 2 (𝑅𝑉𝑋 = ( {𝑋} ∪ (𝐴𝐵)))
34 uniun 4456 . 2 ({𝑋} ∪ (𝐴𝐵)) = ( {𝑋} ∪ (𝐴𝐵))
3533, 34syl6eqr 2674 1 (𝑅𝑉𝑋 = ({𝑋} ∪ (𝐴𝐵)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  {crab 2916  Vcvv 3200  cun 3572  wss 3574  𝒫 cpw 4158  {csn 4177   cuni 4436   class class class wbr 4653  cmpt 4729  dom cdm 5114  ran crn 5115  wf 5884
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fv 5896
This theorem is referenced by:  ordtbas2  20995  ordtbas  20996  ordttopon  20997  ordtopn1  20998  ordtopn2  20999  ordtrest2  21008  ordthmeolem  21604  ordtprsuni  29965
  Copyright terms: Public domain W3C validator