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

Theorem dibopelvalN 41949
Description: Member of the partial isomorphism B. (Contributed by NM, 18-Jan-2014.) (Revised by Mario Carneiro, 6-May-2015.) (New usage is discouraged.)
Hypotheses
Ref Expression
dibval.b 𝐵 = (Base‘𝐾)
dibval.h 𝐻 = (LHyp‘𝐾)
dibval.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
dibval.o 0 = (𝑓𝑇 ↦ ( I ↾ 𝐵))
dibval.j 𝐽 = ((DIsoA‘𝐾)‘𝑊)
dibval.i 𝐼 = ((DIsoB‘𝐾)‘𝑊)
Assertion
Ref Expression
dibopelvalN (((𝐾𝑉𝑊𝐻) ∧ 𝑋 ∈ dom 𝐽) → (⟨𝐹, 𝑆⟩ ∈ (𝐼𝑋) ↔ (𝐹 ∈ (𝐽𝑋) ∧ 𝑆 = 0 )))
Distinct variable groups:   𝑓,𝐾   𝑓,𝑊   𝑇,𝑓
Allowed substitution hints:   𝐵(𝑓)   𝑆(𝑓)   𝐹(𝑓)   𝐻(𝑓)   𝐼(𝑓)   𝐽(𝑓)   𝑉(𝑓)   𝑋(𝑓)   0 (𝑓)

Proof of Theorem dibopelvalN
StepHypRef Expression
1 dibval.b . . . 4 𝐵 = (Base‘𝐾)
2 dibval.h . . . 4 𝐻 = (LHyp‘𝐾)
3 dibval.t . . . 4 𝑇 = ((LTrn‘𝐾)‘𝑊)
4 dibval.o . . . 4 0 = (𝑓𝑇 ↦ ( I ↾ 𝐵))
5 dibval.j . . . 4 𝐽 = ((DIsoA‘𝐾)‘𝑊)
6 dibval.i . . . 4 𝐼 = ((DIsoB‘𝐾)‘𝑊)
71, 2, 3, 4, 5, 6dibval 41948 . . 3 (((𝐾𝑉𝑊𝐻) ∧ 𝑋 ∈ dom 𝐽) → (𝐼𝑋) = ((𝐽𝑋) × { 0 }))
87eleq2d 2852 . 2 (((𝐾𝑉𝑊𝐻) ∧ 𝑋 ∈ dom 𝐽) → (⟨𝐹, 𝑆⟩ ∈ (𝐼𝑋) ↔ ⟨𝐹, 𝑆⟩ ∈ ((𝐽𝑋) × { 0 })))
9 opelxp 5700 . . 3 (⟨𝐹, 𝑆⟩ ∈ ((𝐽𝑋) × { 0 }) ↔ (𝐹 ∈ (𝐽𝑋) ∧ 𝑆 ∈ { 0 }))
103fvexi 6899 . . . . . . 7 𝑇 ∈ V
1110mptex 7225 . . . . . 6 (𝑓𝑇 ↦ ( I ↾ 𝐵)) ∈ V
124, 11eqeltri 2862 . . . . 5 0 ∈ V
1312elsn2 4634 . . . 4 (𝑆 ∈ { 0 } ↔ 𝑆 = 0 )
1413anbi2i 635 . . 3 ((𝐹 ∈ (𝐽𝑋) ∧ 𝑆 ∈ { 0 }) ↔ (𝐹 ∈ (𝐽𝑋) ∧ 𝑆 = 0 ))
159, 14bitri 278 . 2 (⟨𝐹, 𝑆⟩ ∈ ((𝐽𝑋) × { 0 }) ↔ (𝐹 ∈ (𝐽𝑋) ∧ 𝑆 = 0 ))
168, 15bitrdi 290 1 (((𝐾𝑉𝑊𝐻) ∧ 𝑋 ∈ dom 𝐽) → (⟨𝐹, 𝑆⟩ ∈ (𝐼𝑋) ↔ (𝐹 ∈ (𝐽𝑋) ∧ 𝑆 = 0 )))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  Vcvv 3458  {csn 4592  cop 4598  cmpt 5195   I cid 5558   × cxp 5662  dom cdm 5664  cres 5666  cfv 6540  Basecbs 17279  LHypclh 40790  LTrncltrn 40907  DIsoAcdia 41834  DIsoBcdib 41944
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 2738  ax-rep 5241  ax-sep 5260  ax-nul 5272  ax-pow 5339  ax-pr 5407  ax-un 7738
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4876  df-iun 4961  df-br 5113  df-opab 5177  df-mpt 5196  df-id 5559  df-xp 5670  df-rel 5671  df-cnv 5672  df-co 5673  df-dm 5674  df-rn 5675  df-res 5676  df-ima 5677  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-dib 41945
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator