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 42431
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 5109 . . . . . . 7 (𝑝 = 𝑞 → (𝑝 ≤ 𝑊 ↔ 𝑞 ≤ 𝑊))
21notbid 321 . . . . . 6 (𝑝 = 𝑞 → (¬ 𝑝 ≤ 𝑊 ↔ ¬ 𝑞 ≤ 𝑊))
32elrab 3648 . . . . 5 (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↔ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊))
4 dicfn.l . . . . . . 7 ≤ = (le‘𝐾)
5 dicfn.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
6 dicfn.h . . . . . . 7 𝐻 = (LHyp‘𝐾)
7 eqid 2763 . . . . . . 7 ((oc‘𝐾)‘𝑊) = ((oc‘𝐾)‘𝑊)
8 eqid 2763 . . . . . . 7 ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊)
9 eqid 2763 . . . . . . 7 ((TEndo‘𝐾)‘𝑊) = ((TEndo‘𝐾)‘𝑊)
10 dicfn.i . . . . . . 7 𝐼 = ((DIsoC‘𝐾)‘𝑊)
114, 5, 6, 7, 8, 9, 10dicval 42424 . . . . . 6 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) → (𝐼‘𝑞) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))})
12 fvex 6918 . . . . . 6 (𝐼‘𝑞) ∈ V
1311, 12eqeltrrdi 2873 . . . . 5 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) → {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))} ∈ V)
143, 13sylan2b 606 . . . 4 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊}) → {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))} ∈ V)
1514ralrimiva 3158 . . 3 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → ∀𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))} ∈ V)
16 eqid 2763 . . . 4 (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}) = (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))})
1716fnmpt 6698 . . 3 (∀𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))} ∈ V → (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}) Fn {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊})
1815, 17syl 18 . 2 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}) Fn {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊})
194, 5, 6, 7, 8, 9, 10dicfval 42423 . . 3 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 = (𝑞 ∈ {𝑝 ∈ 𝐴 ∣ ¬ 𝑝 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑢 ∈ ((LTrn‘𝐾)‘𝑊)(𝑢‘((oc‘𝐾)‘𝑊)) = 𝑞)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}))
2019fneq1d 6651 . 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 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454   class class class wbr 5106  {copab 5170   ↦ cmpt 5189   Fn wfn 6550  ‘cfv 6555  ℩crio 7396  lecple 17461  occoc 17462  Atomscatm 40511  LHypclh 41232  LTrncltrn 41349  TEndoctendo 42000  DIsoCcdic 42420
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 2102  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 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-dic 42421
This theorem is used by:  dicdmN  42432
  Copyright terms: Public domain W3C validator