Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dibelval3 Structured version   Visualization version   GIF version

Theorem dibelval3 41981
Description: Member of the partial isomorphism B. (Contributed by NM, 26-Feb-2014.)
Hypotheses
Ref Expression
dibval3.b 𝐵 = (Base‘𝐾)
dibval3.l = (le‘𝐾)
dibval3.h 𝐻 = (LHyp‘𝐾)
dibval3.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
dibval3.r 𝑅 = ((trL‘𝐾)‘𝑊)
dibval3.o 0 = (𝑔𝑇 ↦ ( I ↾ 𝐵))
dibval3.i 𝐼 = ((DIsoB‘𝐾)‘𝑊)
Assertion
Ref Expression
dibelval3 (((𝐾𝑉𝑊𝐻) ∧ (𝑋𝐵𝑋 𝑊)) → (𝑌 ∈ (𝐼𝑋) ↔ ∃𝑓𝑇 (𝑌 = ⟨𝑓, 0 ⟩ ∧ (𝑅𝑓) 𝑋)))
Distinct variable groups:   𝑓,𝐾   𝑔,𝐾   𝑇,𝑓   𝑓,𝑊   𝑔,𝑊   𝑓,𝑋   ,𝑓   𝐵,𝑓   𝑓,𝐻   0 ,𝑓   𝑇,𝑔   𝑓,𝑉   𝑓,𝑌
Allowed substitution hints:   𝐵(𝑔)   𝑅(𝑓, 𝑔)   𝐻(𝑔)   𝐼(𝑓, 𝑔)   (𝑔)   𝑉(𝑔)   𝑋(𝑔)   𝑌(𝑔)   0 (𝑔)

Proof of Theorem dibelval3
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 dibval3.b . . . 4 𝐵 = (Base‘𝐾)
2 dibval3.l . . . 4 = (le‘𝐾)
3 dibval3.h . . . 4 𝐻 = (LHyp‘𝐾)
4 dibval3.t . . . 4 𝑇 = ((LTrn‘𝐾)‘𝑊)
5 dibval3.o . . . 4 0 = (𝑔𝑇 ↦ ( I ↾ 𝐵))
6 eqid 2765 . . . 4 ((DIsoA‘𝐾)‘𝑊) = ((DIsoA‘𝐾)‘𝑊)
7 dibval3.i . . . 4 𝐼 = ((DIsoB‘𝐾)‘𝑊)
81, 2, 3, 4, 5, 6, 7dibval2 41978 . . 3 (((𝐾𝑉𝑊𝐻) ∧ (𝑋𝐵𝑋 𝑊)) → (𝐼𝑋) = ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × { 0 }))
98eleq2d 2851 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑋𝐵𝑋 𝑊)) → (𝑌 ∈ (𝐼𝑋) ↔ 𝑌 ∈ ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × { 0 })))
10 dibval3.r . . . . . . 7 𝑅 = ((trL‘𝐾)‘𝑊)
111, 2, 3, 4, 10, 6diaelval 41867 . . . . . 6 (((𝐾𝑉𝑊𝐻) ∧ (𝑋𝐵𝑋 𝑊)) → (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ↔ (𝑓𝑇 ∧ (𝑅𝑓) 𝑋)))
1211anbi1d 643 . . . . 5 (((𝐾𝑉𝑊𝐻) ∧ (𝑋𝐵𝑋 𝑊)) → ((𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 0 ⟩) ↔ ((𝑓𝑇 ∧ (𝑅𝑓) 𝑋) ∧ 𝑌 = ⟨𝑓, 0 ⟩)))
13 an13 660 . . . . . . . 8 ((𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })) ↔ (𝑠 ∈ { 0 } ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩)))
14 velsn 4607 . . . . . . . . 9 (𝑠 ∈ { 0 } ↔ 𝑠 = 0 )
1514anbi1i 636 . . . . . . . 8 ((𝑠 ∈ { 0 } ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩)) ↔ (𝑠 = 0 ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩)))
1613, 15bitri 278 . . . . . . 7 ((𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })) ↔ (𝑠 = 0 ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩)))
1716exbii 1881 . . . . . 6 (∃𝑠(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })) ↔ ∃𝑠(𝑠 = 0 ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩)))
184fvexi 6899 . . . . . . . . 9 𝑇 ∈ V
1918mptex 7228 . . . . . . . 8 (𝑔𝑇 ↦ ( I ↾ 𝐵)) ∈ V
205, 19eqeltri 2861 . . . . . . 7 0 ∈ V
21 opeq2 4841 . . . . . . . . 9 (𝑠 = 0 → ⟨𝑓, 𝑠⟩ = ⟨𝑓, 0 ⟩)
2221eqeq2d 2776 . . . . . . . 8 (𝑠 = 0 → (𝑌 = ⟨𝑓, 𝑠⟩ ↔ 𝑌 = ⟨𝑓, 0 ⟩))
2322anbi2d 642 . . . . . . 7 (𝑠 = 0 → ((𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩) ↔ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 0 ⟩)))
2420, 23ceqsexv 3505 . . . . . 6 (∃𝑠(𝑠 = 0 ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩)) ↔ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 0 ⟩))
2517, 24bitri 278 . . . . 5 (∃𝑠(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })) ↔ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 0 ⟩))
26 anass 474 . . . . . 6 (((𝑓𝑇𝑌 = ⟨𝑓, 0 ⟩) ∧ (𝑅𝑓) 𝑋) ↔ (𝑓𝑇 ∧ (𝑌 = ⟨𝑓, 0 ⟩ ∧ (𝑅𝑓) 𝑋)))
27 an32 659 . . . . . 6 (((𝑓𝑇𝑌 = ⟨𝑓, 0 ⟩) ∧ (𝑅𝑓) 𝑋) ↔ ((𝑓𝑇 ∧ (𝑅𝑓) 𝑋) ∧ 𝑌 = ⟨𝑓, 0 ⟩))
2826, 27bitr3i 280 . . . . 5 ((𝑓𝑇 ∧ (𝑌 = ⟨𝑓, 0 ⟩ ∧ (𝑅𝑓) 𝑋)) ↔ ((𝑓𝑇 ∧ (𝑅𝑓) 𝑋) ∧ 𝑌 = ⟨𝑓, 0 ⟩))
2912, 25, 283bitr4g 317 . . . 4 (((𝐾𝑉𝑊𝐻) ∧ (𝑋𝐵𝑋 𝑊)) → (∃𝑠(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })) ↔ (𝑓𝑇 ∧ (𝑌 = ⟨𝑓, 0 ⟩ ∧ (𝑅𝑓) 𝑋))))
3029exbidv 1954 . . 3 (((𝐾𝑉𝑊𝐻) ∧ (𝑋𝐵𝑋 𝑊)) → (∃𝑓𝑠(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })) ↔ ∃𝑓(𝑓𝑇 ∧ (𝑌 = ⟨𝑓, 0 ⟩ ∧ (𝑅𝑓) 𝑋))))
31 elxp 5686 . . 3 (𝑌 ∈ ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × { 0 }) ↔ ∃𝑓𝑠(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })))
32 df-rex 3092 . . 3 (∃𝑓𝑇 (𝑌 = ⟨𝑓, 0 ⟩ ∧ (𝑅𝑓) 𝑋) ↔ ∃𝑓(𝑓𝑇 ∧ (𝑌 = ⟨𝑓, 0 ⟩ ∧ (𝑅𝑓) 𝑋)))
3330, 31, 323bitr4g 317 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑋𝐵𝑋 𝑊)) → (𝑌 ∈ ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × { 0 }) ↔ ∃𝑓𝑇 (𝑌 = ⟨𝑓, 0 ⟩ ∧ (𝑅𝑓) 𝑋)))
349, 33bitrd 282 1 (((𝐾𝑉𝑊𝐻) ∧ (𝑋𝐵𝑋 𝑊)) → (𝑌 ∈ (𝐼𝑋) ↔ ∃𝑓𝑇 (𝑌 = ⟨𝑓, 0 ⟩ ∧ (𝑅𝑓) 𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wex 1812  wcel 2146  wrex 3091  Vcvv 3457  {csn 4591  cop 4597   class class class wbr 5111  cmpt 5194   I cid 5557   × cxp 5661  cres 5665  cfv 6540  Basecbs 17293  lecple 17341  LHypclh 40818  LTrncltrn 40935  trLctrl 40992  DIsoAcdia 41862  DIsoBcdib 41972
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-disoa 41863  df-dib 41973
This theorem is used by:  cdlemn11pre  42044  dihord2pre  42059
  Copyright terms: Public domain W3C validator