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

Theorem ipoval 17767
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 3515 . 2 (𝐹𝑉𝐹 ∈ V)
2 ipoval.i . . 3 𝐼 = (toInc‘𝐹)
3 vex 3500 . . . . . . . 8 𝑓 ∈ V
43, 3xpex 7479 . . . . . . 7 (𝑓 × 𝑓) ∈ V
5 simpl 485 . . . . . . . . . 10 (({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦) → {𝑥, 𝑦} ⊆ 𝑓)
6 vex 3500 . . . . . . . . . . 11 𝑥 ∈ V
7 vex 3500 . . . . . . . . . . 11 𝑦 ∈ V
86, 7prss 4756 . . . . . . . . . 10 ((𝑥𝑓𝑦𝑓) ↔ {𝑥, 𝑦} ⊆ 𝑓)
95, 8sylibr 236 . . . . . . . . 9 (({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦) → (𝑥𝑓𝑦𝑓))
109ssopab2i 5440 . . . . . . . 8 {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑓𝑦𝑓)}
11 df-xp 5564 . . . . . . . 8 (𝑓 × 𝑓) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑓𝑦𝑓)}
1210, 11sseqtrri 4007 . . . . . . 7 {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} ⊆ (𝑓 × 𝑓)
134, 12ssexi 5229 . . . . . 6 {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} ∈ V
1413a1i 11 . . . . 5 (𝑓 = 𝐹 → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} ∈ V)
15 sseq2 3996 . . . . . . . 8 (𝑓 = 𝐹 → ({𝑥, 𝑦} ⊆ 𝑓 ↔ {𝑥, 𝑦} ⊆ 𝐹))
1615anbi1d 631 . . . . . . 7 (𝑓 = 𝐹 → (({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦) ↔ ({𝑥, 𝑦} ⊆ 𝐹𝑥𝑦)))
1716opabbidv 5135 . . . . . 6 (𝑓 = 𝐹 → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐹𝑥𝑦)})
18 ipoval.l . . . . . 6 = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐹𝑥𝑦)}
1917, 18syl6eqr 2877 . . . . 5 (𝑓 = 𝐹 → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} = )
20 simpl 485 . . . . . . . 8 ((𝑓 = 𝐹𝑜 = ) → 𝑓 = 𝐹)
2120opeq2d 4813 . . . . . . 7 ((𝑓 = 𝐹𝑜 = ) → ⟨(Base‘ndx), 𝑓⟩ = ⟨(Base‘ndx), 𝐹⟩)
22 simpr 487 . . . . . . . . 9 ((𝑓 = 𝐹𝑜 = ) → 𝑜 = )
2322fveq2d 6677 . . . . . . . 8 ((𝑓 = 𝐹𝑜 = ) → (ordTop‘𝑜) = (ordTop‘ ))
2423opeq2d 4813 . . . . . . 7 ((𝑓 = 𝐹𝑜 = ) → ⟨(TopSet‘ndx), (ordTop‘𝑜)⟩ = ⟨(TopSet‘ndx), (ordTop‘ )⟩)
2521, 24preq12d 4680 . . . . . 6 ((𝑓 = 𝐹𝑜 = ) → {⟨(Base‘ndx), 𝑓⟩, ⟨(TopSet‘ndx), (ordTop‘𝑜)⟩} = {⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩})
2622opeq2d 4813 . . . . . . 7 ((𝑓 = 𝐹𝑜 = ) → ⟨(le‘ndx), 𝑜⟩ = ⟨(le‘ndx), ⟩)
27 id 22 . . . . . . . . . 10 (𝑓 = 𝐹𝑓 = 𝐹)
28 rabeq 3486 . . . . . . . . . . 11 (𝑓 = 𝐹 → {𝑦𝑓 ∣ (𝑦𝑥) = ∅} = {𝑦𝐹 ∣ (𝑦𝑥) = ∅})
2928unieqd 4855 . . . . . . . . . 10 (𝑓 = 𝐹 {𝑦𝑓 ∣ (𝑦𝑥) = ∅} = {𝑦𝐹 ∣ (𝑦𝑥) = ∅})
3027, 29mpteq12dv 5154 . . . . . . . . 9 (𝑓 = 𝐹 → (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅}) = (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅}))
3130adantr 483 . . . . . . . 8 ((𝑓 = 𝐹𝑜 = ) → (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅}) = (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅}))
3231opeq2d 4813 . . . . . . 7 ((𝑓 = 𝐹𝑜 = ) → ⟨(oc‘ndx), (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅})⟩ = ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩)
3326, 32preq12d 4680 . . . . . 6 ((𝑓 = 𝐹𝑜 = ) → {⟨(le‘ndx), 𝑜⟩, ⟨(oc‘ndx), (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅})⟩} = {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩})
3425, 33uneq12d 4143 . . . . 5 ((𝑓 = 𝐹𝑜 = ) → ({⟨(Base‘ndx), 𝑓⟩, ⟨(TopSet‘ndx), (ordTop‘𝑜)⟩} ∪ {⟨(le‘ndx), 𝑜⟩, ⟨(oc‘ndx), (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅})⟩}) = ({⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∪ {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩}))
3514, 19, 34csbied2 3923 . . . 4 (𝑓 = 𝐹{⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} / 𝑜({⟨(Base‘ndx), 𝑓⟩, ⟨(TopSet‘ndx), (ordTop‘𝑜)⟩} ∪ {⟨(le‘ndx), 𝑜⟩, ⟨(oc‘ndx), (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅})⟩}) = ({⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∪ {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩}))
36 df-ipo 17765 . . . 4 toInc = (𝑓 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑓𝑥𝑦)} / 𝑜({⟨(Base‘ndx), 𝑓⟩, ⟨(TopSet‘ndx), (ordTop‘𝑜)⟩} ∪ {⟨(le‘ndx), 𝑜⟩, ⟨(oc‘ndx), (𝑥𝑓 {𝑦𝑓 ∣ (𝑦𝑥) = ∅})⟩}))
37 prex 5336 . . . . 5 {⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∈ V
38 prex 5336 . . . . 5 {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩} ∈ V
3937, 38unex 7472 . . . 4 ({⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∪ {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩}) ∈ V
4035, 36, 39fvmpt 6771 . . 3 (𝐹 ∈ V → (toInc‘𝐹) = ({⟨(Base‘ndx), 𝐹⟩, ⟨(TopSet‘ndx), (ordTop‘ )⟩} ∪ {⟨(le‘ndx), ⟩, ⟨(oc‘ndx), (𝑥𝐹 {𝑦𝐹 ∣ (𝑦𝑥) = ∅})⟩}))
412, 40syl5eq 2871 . 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 398   = wceq 1536  wcel 2113  {crab 3145  Vcvv 3497  csb 3886  cun 3937  cin 3938  wss 3939  c0 4294  {cpr 4572  cop 4576   cuni 4841  {copab 5131  cmpt 5149   × cxp 5556  cfv 6358  ndxcnx 16483  Basecbs 16486  TopSetcts 16574  lecple 16575  occoc 16576  ordTopcordt 16775  toInccipo 17764
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ral 3146  df-rex 3147  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-iota 6317  df-fun 6360  df-fv 6366  df-ipo 17765
This theorem is referenced by:  ipobas  17768  ipolerval  17769  ipotset  17770
  Copyright terms: Public domain W3C validator