ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fliftfuns GIF version

Theorem fliftfuns 5915
Description: The function 𝐹 is the unique function defined by 𝐹𝐴 = 𝐵, provided that the well-definedness condition holds. (Contributed by Mario Carneiro, 23-Dec-2016.)
Hypotheses
Ref Expression
flift.1 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
flift.2 ((𝜑𝑥𝑋) → 𝐴𝑅)
flift.3 ((𝜑𝑥𝑋) → 𝐵𝑆)
Assertion
Ref Expression
fliftfuns (𝜑 → (Fun 𝐹 ↔ ∀𝑦𝑋𝑧𝑋 (𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴𝑦 / 𝑥𝐵 = 𝑧 / 𝑥𝐵)))
Distinct variable groups:   𝑦,𝑧,𝐴   𝑦,𝐵,𝑧   𝑥,𝑧,𝑦,𝑅   𝑦,𝐹,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem fliftfuns
StepHypRef Expression
1 flift.1 . . 3 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
2 nfcv 2372 . . . . 5 𝑦𝐴, 𝐵
3 nfcsb1v 3157 . . . . . 6 𝑥𝑦 / 𝑥𝐴
4 nfcsb1v 3157 . . . . . 6 𝑥𝑦 / 𝑥𝐵
53, 4nfop 3872 . . . . 5 𝑥𝑦 / 𝑥𝐴, 𝑦 / 𝑥𝐵
6 csbeq1a 3133 . . . . . 6 (𝑥 = 𝑦𝐴 = 𝑦 / 𝑥𝐴)
7 csbeq1a 3133 . . . . . 6 (𝑥 = 𝑦𝐵 = 𝑦 / 𝑥𝐵)
86, 7opeq12d 3864 . . . . 5 (𝑥 = 𝑦 → ⟨𝐴, 𝐵⟩ = ⟨𝑦 / 𝑥𝐴, 𝑦 / 𝑥𝐵⟩)
92, 5, 8cbvmpt 4178 . . . 4 (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩) = (𝑦𝑋 ↦ ⟨𝑦 / 𝑥𝐴, 𝑦 / 𝑥𝐵⟩)
109rneqi 4948 . . 3 ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩) = ran (𝑦𝑋 ↦ ⟨𝑦 / 𝑥𝐴, 𝑦 / 𝑥𝐵⟩)
111, 10eqtri 2250 . 2 𝐹 = ran (𝑦𝑋 ↦ ⟨𝑦 / 𝑥𝐴, 𝑦 / 𝑥𝐵⟩)
12 flift.2 . . . 4 ((𝜑𝑥𝑋) → 𝐴𝑅)
1312ralrimiva 2603 . . 3 (𝜑 → ∀𝑥𝑋 𝐴𝑅)
143nfel1 2383 . . . 4 𝑥𝑦 / 𝑥𝐴𝑅
156eleq1d 2298 . . . 4 (𝑥 = 𝑦 → (𝐴𝑅𝑦 / 𝑥𝐴𝑅))
1614, 15rspc 2901 . . 3 (𝑦𝑋 → (∀𝑥𝑋 𝐴𝑅𝑦 / 𝑥𝐴𝑅))
1713, 16mpan9 281 . 2 ((𝜑𝑦𝑋) → 𝑦 / 𝑥𝐴𝑅)
18 flift.3 . . . 4 ((𝜑𝑥𝑋) → 𝐵𝑆)
1918ralrimiva 2603 . . 3 (𝜑 → ∀𝑥𝑋 𝐵𝑆)
204nfel1 2383 . . . 4 𝑥𝑦 / 𝑥𝐵𝑆
217eleq1d 2298 . . . 4 (𝑥 = 𝑦 → (𝐵𝑆𝑦 / 𝑥𝐵𝑆))
2220, 21rspc 2901 . . 3 (𝑦𝑋 → (∀𝑥𝑋 𝐵𝑆𝑦 / 𝑥𝐵𝑆))
2319, 22mpan9 281 . 2 ((𝜑𝑦𝑋) → 𝑦 / 𝑥𝐵𝑆)
24 csbeq1 3127 . 2 (𝑦 = 𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴)
25 csbeq1 3127 . 2 (𝑦 = 𝑧𝑦 / 𝑥𝐵 = 𝑧 / 𝑥𝐵)
2611, 17, 23, 24, 25fliftfun 5913 1 (𝜑 → (Fun 𝐹 ↔ ∀𝑦𝑋𝑧𝑋 (𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴𝑦 / 𝑥𝐵 = 𝑧 / 𝑥𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1395  wcel 2200  wral 2508  csb 3124  cop 3669  cmpt 4144  ran crn 4717  Fun wfun 5308
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4381  df-xp 4722  df-rel 4723  df-cnv 4724  df-co 4725  df-dm 4726  df-rn 4727  df-res 4728  df-ima 4729  df-iota 5274  df-fun 5316  df-fn 5317  df-f 5318  df-fv 5322
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator