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

Theorem ipoval 18467
Description: Value of the inclusion poset. (Contributed by Stefan O'Rear, 30-Jan-2015.)
Hypotheses
Ref Expression
ipoval.i 𝐼 = (toInc‘𝐹)
ipoval.l = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐹𝑥𝑦)}
Assertion
Ref Expression
ipoval (𝐹𝑉𝐼 = ({⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∪ {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩}))
Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝐼,𝑦   𝑥,𝑉,𝑦
Allowed substitution hints:   (𝑥,𝑦)

Proof of Theorem ipoval
Dummy variables 𝑓 𝑜 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3463 . 2 (𝐹𝑉𝐹 ∈ V)
2 ipoval.i . . 3 𝐼 = (toInc‘𝐹)
3 vex 3446 . . . . . . . 8 𝑓 ∈ V
43, 3xpex 7710 . . . . . . 7 (𝑓 × 𝑓) ∈ V
5 simpl 482 . . . . . . . . . 10 (({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦) → {𝑥, 𝑦} ⊆ 𝑓)
6 vex 3446 . . . . . . . . . . 11 𝑥 ∈ V
7 vex 3446 . . . . . . . . . . 11 𝑦 ∈ V
86, 7prss 4778 . . . . . . . . . 10 ((𝑥𝑓𝑦𝑓) ↔ {𝑥, 𝑦} ⊆ 𝑓)
95, 8sylibr 234 . . . . . . . . 9 (({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦) → (𝑥𝑓𝑦𝑓))
109ssopab2i 5508 . . . . . . . 8 {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑓𝑦𝑓)}
11 df-xp 5640 . . . . . . . 8 (𝑓 × 𝑓) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑓𝑦𝑓)}
1210, 11sseqtrri 3985 . . . . . . 7 {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} ⊆ (𝑓 × 𝑓)
134, 12ssexi 5271 . . . . . 6 {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} ∈ V
1413a1i 11 . . . . 5 (𝑓 = 𝐹 → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} ∈ V)
15 sseq2 3962 . . . . . . . 8 (𝑓 = 𝐹 → ({𝑥, 𝑦} ⊆ 𝑓 ↔ {𝑥, 𝑦} ⊆ 𝐹))
1615anbi1d 632 . . . . . . 7 (𝑓 = 𝐹 → (({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦) ↔ ({𝑥, 𝑦} ⊆ 𝐹𝑥𝑦)))
1716opabbidv 5166 . . . . . 6 (𝑓 = 𝐹 → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐹𝑥𝑦)})
18 ipoval.l . . . . . 6 = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐹𝑥𝑦)}
1917, 18eqtr4di 2790 . . . . 5 (𝑓 = 𝐹 → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} = )
20 simpl 482 . . . . . . . 8 ((𝑓 = 𝐹𝑜 = ) → 𝑓 = 𝐹)
2120opeq2d 4838 . . . . . . 7 ((𝑓 = 𝐹𝑜 = ) → ⟨(Base‘ndx), 𝑓⟩ = ⟨(Base‘ndx), 𝐹⟩)
22 simpr 484 . . . . . . . . 9 ((𝑓 = 𝐹𝑜 = ) → 𝑜 = )
2322fveq2d 6848 . . . . . . . 8 ((𝑓 = 𝐹𝑜 = ) → (ordTop‘𝑜) = (ordTop‘ ))
2423opeq2d 4838 . . . . . . 7 ((𝑓 = 𝐹𝑜 = ) → ⟨(TopSet‘ndx), (ordTop‘𝑜)⟩ = ⟨(TopSet‘ndx), (ordTop‘ )⟩)
2521, 24preq12d 4700 . . . . . 6 ((𝑓 = 𝐹𝑜 = ) → {⟨(Base‘ndx), 𝑓⟩, ⟨(TopSet‘ndx), (ordTop‘𝑜)⟩} = {⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩})
2622opeq2d 4838 . . . . . . 7 ((𝑓 = 𝐹𝑜 = ) → ⟨(le‘ndx), 𝑜⟩ = ⟨(le‘ndx), ⟩)
27 id 22 . . . . . . . . . 10 (𝑓 = 𝐹𝑓 = 𝐹)
28 rabeq 3415 . . . . . . . . . . 11 (𝑓 = 𝐹 → {𝑦𝑓 ∣ (𝑦𝑥) = ∅} = {𝑦𝐹 ∣ (𝑦𝑥) = ∅})
2928unieqd 4878 . . . . . . . . . 10 (𝑓 = 𝐹 {𝑦𝑓 ∣ (𝑦𝑥) = ∅} = {𝑦𝐹 ∣ (𝑦𝑥) = ∅})
3027, 29mpteq12dv 5187 . . . . . . . . 9 (𝑓 = 𝐹 → (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅}) = (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅}))
3130adantr 480 . . . . . . . 8 ((𝑓 = 𝐹𝑜 = ) → (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅}) = (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅}))
3231opeq2d 4838 . . . . . . 7 ((𝑓 = 𝐹𝑜 = ) → ⟨(oc‘ndx), (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅})⟩ = ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩)
3326, 32preq12d 4700 . . . . . 6 ((𝑓 = 𝐹𝑜 = ) → {⟨(le‘ndx), 𝑜⟩, ⟨(oc‘ndx), (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅})⟩} = {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩})
3425, 33uneq12d 4123 . . . . 5 ((𝑓 = 𝐹𝑜 = ) → ({⟨(Base‘ndx), 𝑓⟩, ⟨(TopSet‘ndx), (ordTop‘𝑜)⟩} ∪ {⟨(le‘ndx), 𝑜⟩, ⟨(oc‘ndx), (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅})⟩}) = ({⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∪ {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩}))
3514, 19, 34csbied2 3888 . . . 4 (𝑓 = 𝐹{⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} / 𝑜({⟨(Base‘ndx), 𝑓⟩, ⟨(TopSet‘ndx), (ordTop‘𝑜)⟩} ∪ {⟨(le‘ndx), 𝑜⟩, ⟨(oc‘ndx), (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅})⟩}) = ({⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∪ {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩}))
36 df-ipo 18465 . . . 4 toInc = (𝑓 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} / 𝑜({⟨(Base‘ndx), 𝑓⟩, ⟨(TopSet‘ndx), (ordTop‘𝑜)⟩} ∪ {⟨(le‘ndx), 𝑜⟩, ⟨(oc‘ndx), (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅})⟩}))
37 prex 5386 . . . . 5 {⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∈ V
38 prex 5386 . . . . 5 {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩} ∈ V
3937, 38unex 7701 . . . 4 ({⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∪ {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩}) ∈ V
4035, 36, 39fvmpt 6951 . . 3 (𝐹 ∈ V → (toInc‘𝐹) = ({⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∪ {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩}))
412, 40eqtrid 2784 . 2 (𝐹 ∈ V → 𝐼 = ({⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∪ {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩}))
421, 41syl 17 1 (𝐹𝑉𝐼 = ({⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∪ {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {crab 3401  Vcvv 3442  csb 3851  cun 3901  cin 3902  wss 3903  c0 4287  {cpr 4584  cop 4588   cuni 4865  {copab 5162  cmpt 5181   × cxp 5632  cfv 6502  ndxcnx 17134  Basecbs 17150  TopSetcts 17197  lecple 17198  occoc 17199  ordTopcordt 17434  toInccipo 18464
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5245  ax-pow 5314  ax-pr 5381  ax-un 7692
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5529  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-iota 6458  df-fun 6504  df-fv 6510  df-ipo 18465
This theorem is referenced by:  ipobas  18468  ipolerval  18469  ipotset  18470
  Copyright terms: Public domain W3C validator