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

Theorem dicfnN 42241
Description: Functionality and domain of the partial isomorphism C. (Contributed by NM, 8-Mar-2014.) (New usage is discouraged.)
Hypotheses
Ref Expression
dicfn.l ≤ = (le‘𝐾)
dicfn.a 𝐴 = (Atoms‘𝐾)
dicfn.h 𝐻 = (LHyp‘𝐾)
dicfn.i 𝐼 = ((DIsoC‘𝐾)‘𝑊)
Assertion
Ref Expression
dicfnN ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 Fn {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊})
Distinct variable groups:   ≤ ,𝑝   𝐴,𝑝   𝐾,𝑝   𝑊,𝑝
Allowed substitution hints:   𝐻(𝑝)   𝐼(𝑝)   𝑉(𝑝)

Proof of Theorem dicfnN
Dummy variables 𝑞 𝑓 𝑠 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq1 5105 . . . . . . 7 (𝑝 = 𝑞 → (𝑝 ≤ 𝑊 ↔ 𝑞 ≤ 𝑊))
21notbid 321 . . . . . 6 (𝑝 = 𝑞 → (¬ 𝑝 ≤ 𝑊 ↔ ¬ 𝑞 ≤ 𝑊))
32elrab 3644 . . . . 5 (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↔ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊))
4 dicfn.l . . . . . . 7 ≤ = (le‘𝐾)
5 dicfn.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
6 dicfn.h . . . . . . 7 𝐻 = (LHyp‘𝐾)
7 eqid 2760 . . . . . . 7 ((oc‘𝐾)‘𝑊) = ((oc‘𝐾)‘𝑊)
8 eqid 2760 . . . . . . 7 ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊)
9 eqid 2760 . . . . . . 7 ((TEndo‘𝐾)‘𝑊) = ((TEndo‘𝐾)‘𝑊)
10 dicfn.i . . . . . . 7 𝐼 = ((DIsoC‘𝐾)‘𝑊)
114, 5, 6, 7, 8, 9, 10dicval 42234 . . . . . 6 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) → (𝐼‘𝑞) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))})
12 fvex 6898 . . . . . 6 (𝐼‘𝑞) ∈ V
1311, 12eqeltrrdi 2869 . . . . 5 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) → {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))} ∈ V)
143, 13sylan2b 606 . . . 4 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊}) → {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))} ∈ V)
1514ralrimiva 3154 . . 3 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → ∀𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))} ∈ V)
16 eqid 2760 . . . 4 (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}) = (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))})
1716fnmpt 6679 . . 3 (∀𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))} ∈ V → (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}) Fn {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊})
1815, 17syl 18 . 2 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}) Fn {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊})
194, 5, 6, 7, 8, 9, 10dicfval 42233 . . 3 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 = (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}))
2019fneq1d 6632 . 2 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝐼 Fn {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↔ (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}) Fn {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊}))
2118, 20mpbird 260 1 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 Fn {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  Vcvv 3450   class class class wbr 5102  {copab 5166   ↦ cmpt 5185   Fn wfn 6533  ‘cfv 6538  ℩crio 7376  lecple 17435  occoc 17436  Atomscatm 40321  LHypclh 41042  LTrncltrn 41159  TEndoctendo 41810  DIsoCcdic 42230
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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
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 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-dic 42231
This theorem is used by:  dicdmN  42242
  Copyright terms: Public domain W3C validator