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

Theorem diafn 42234
Description: Functionality and domain of the partial isomorphism A. (Contributed by NM, 26-Nov-2013.)
Hypotheses
Ref Expression
diafn.b 𝐵 = (Base‘𝐾)
diafn.l ≤ = (le‘𝐾)
diafn.h 𝐻 = (LHyp‘𝐾)
diafn.i 𝐼 = ((DIsoA‘𝐾)‘𝑊)
Assertion
Ref Expression
diafn ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 Fn {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊})
Distinct variable groups:   𝑥, ≤   𝑥,𝐵   𝑥,𝐾   𝑥,𝑊
Allowed substitution hints:   𝐻(𝑥)   𝐼(𝑥)   𝑉(𝑥)

Proof of Theorem diafn
Dummy variables 𝑦 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6909 . . . 4 ((LTrn‘𝐾)‘𝑊) ∈ V
21rabex 5304 . . 3 {𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ∣ (((trL‘𝐾)‘𝑊)‘𝑓) ≤ 𝑦} ∈ V
3 eqid 2763 . . 3 (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ∣ (((trL‘𝐾)‘𝑊)‘𝑓) ≤ 𝑦}) = (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ∣ (((trL‘𝐾)‘𝑊)‘𝑓) ≤ 𝑦})
42, 3fnmpti 6693 . 2 (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ∣ (((trL‘𝐾)‘𝑊)‘𝑓) ≤ 𝑦}) Fn {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊}
5 diafn.b . . . 4 𝐵 = (Base‘𝐾)
6 diafn.l . . . 4 ≤ = (le‘𝐾)
7 diafn.h . . . 4 𝐻 = (LHyp‘𝐾)
8 eqid 2763 . . . 4 ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊)
9 eqid 2763 . . . 4 ((trL‘𝐾)‘𝑊) = ((trL‘𝐾)‘𝑊)
10 diafn.i . . . 4 𝐼 = ((DIsoA‘𝐾)‘𝑊)
115, 6, 7, 8, 9, 10diafval 42231 . . 3 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 = (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ∣ (((trL‘𝐾)‘𝑊)‘𝑓) ≤ 𝑦}))
1211fneq1d 6643 . 2 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝐼 Fn {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊} ↔ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ∣ (((trL‘𝐾)‘𝑊)‘𝑓) ≤ 𝑦}) Fn {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊}))
134, 12mpbiri 261 1 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 Fn {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  {crab 3416   class class class wbr 5106   ↦ cmpt 5189   Fn wfn 6542  ‘cfv 6547  Basecbs 17402  lecple 17450  LHypclh 41184  LTrncltrn 41301  trLctrl 41358  DIsoAcdia 42228
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-pr 5395
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
This theorem is used by:  diadm  42235  diaelrnN  42245  diaf11N  42249
  Copyright terms: Public domain W3C validator