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 42347
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 2763 . . . 4 ((DIsoA‘𝐾)‘𝑊) = ((DIsoA‘𝐾)‘𝑊)
7 dibval3.i . . . 4 𝐼 = ((DIsoB‘𝐾)‘𝑊)
81, 2, 3, 4, 5, 6, 7dibval2 42344 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) = ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × { 0 }))
98eleq2d 2850 . 2 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑋) ↔ 𝑌 ∈ ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × { 0 })))
10 dibval3.r . . . . . . 7 𝑅 = ((trL‘𝐾)‘𝑊)
111, 2, 3, 4, 10, 6diaelval 42233 . . . . . 6 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ↔ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ 𝑋)))
1211anbi1d 643 . . . . 5 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → ((𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 0 ⟩) ↔ ((𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ 𝑋) ∧ 𝑌 = ⟨𝑓, 0 ⟩)))
13 an13 660 . . . . . . . 8 ((𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })) ↔ (𝑠 ∈ { 0 } ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩)))
14 velsn 4600 . . . . . . . . 9 (𝑠 ∈ { 0 } ↔ 𝑠 = 0 )
1514anbi1i 636 . . . . . . . 8 ((𝑠 ∈ { 0 } ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩)) ↔ (𝑠 = 0 ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩)))
1613, 15bitri 278 . . . . . . 7 ((𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })) ↔ (𝑠 = 0 ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩)))
1716exbii 1880 . . . . . 6 (∃𝑠(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })) ↔ ∃𝑠(𝑠 = 0 ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩)))
184fvexi 6910 . . . . . . . . 9 𝑇 ∈ V
1918mptex 7239 . . . . . . . 8 (𝑔 ∈ 𝑇 ↦ ( I ↾ 𝐵)) ∈ V
205, 19eqeltri 2860 . . . . . . 7 0 ∈ V
21 opeq2 4844 . . . . . . . . 9 (𝑠 = 0 → ⟨𝑓, 𝑠⟩ = ⟨𝑓, 0 ⟩)
2221eqeq2d 2774 . . . . . . . 8 (𝑠 = 0 → (𝑌 = ⟨𝑓, 𝑠⟩ ↔ 𝑌 = ⟨𝑓, 0 ⟩))
2322anbi2d 642 . . . . . . 7 (𝑠 = 0 → ((𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 𝑠⟩) ↔ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑌 = ⟨𝑓, 0 ⟩)))
2420, 23ceqsexv 3502 . . . . . 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 1955 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (∃𝑓∃𝑠(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })) ↔ ∃𝑓(𝑓 ∈ 𝑇 ∧ (𝑌 = ⟨𝑓, 0 ⟩ ∧ (𝑅‘𝑓) ≤ 𝑋))))
31 elxp 5678 . . 3 (𝑌 ∈ ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × { 0 }) ↔ ∃𝑓∃𝑠(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 ∈ (((DIsoA‘𝐾)‘𝑊)‘𝑋) ∧ 𝑠 ∈ { 0 })))
32 df-rex 3091 . . 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 1569  ∃wex 1811   ∈ wcel 2146  ∃wrex 3090  Vcvv 3454  {csn 4588  ⟨cop 4838   class class class wbr 5106   ↦ cmpt 5189   I cid 5549   × cxp 5653   ↾ cres 5657  ‘cfv 6547  Basecbs 17402  lecple 17450  LHypclh 41184  LTrncltrn 41301  trLctrl 41358  DIsoAcdia 42228  DIsoBcdib 42338
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-disoa 42229  df-dib 42339
This theorem is used by:  cdlemn11pre  42410  dihord2pre  42425
  Copyright terms: Public domain W3C validator