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

Theorem fliftfuns 5707
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 2282 . . . . 5 𝑦𝐴, 𝐵
3 nfcsb1v 3040 . . . . . 6 𝑥𝑦 / 𝑥𝐴
4 nfcsb1v 3040 . . . . . 6 𝑥𝑦 / 𝑥𝐵
53, 4nfop 3729 . . . . 5 𝑥𝑦 / 𝑥𝐴, 𝑦 / 𝑥𝐵
6 csbeq1a 3016 . . . . . 6 (𝑥 = 𝑦𝐴 = 𝑦 / 𝑥𝐴)
7 csbeq1a 3016 . . . . . 6 (𝑥 = 𝑦𝐵 = 𝑦 / 𝑥𝐵)
86, 7opeq12d 3721 . . . . 5 (𝑥 = 𝑦 → ⟨𝐴, 𝐵⟩ = ⟨𝑦 / 𝑥𝐴, 𝑦 / 𝑥𝐵⟩)
92, 5, 8cbvmpt 4031 . . . 4 (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩) = (𝑦𝑋 ↦ ⟨𝑦 / 𝑥𝐴, 𝑦 / 𝑥𝐵⟩)
109rneqi 4775 . . 3 ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩) = ran (𝑦𝑋 ↦ ⟨𝑦 / 𝑥𝐴, 𝑦 / 𝑥𝐵⟩)
111, 10eqtri 2161 . 2 𝐹 = ran (𝑦𝑋 ↦ ⟨𝑦 / 𝑥𝐴, 𝑦 / 𝑥𝐵⟩)
12 flift.2 . . . 4 ((𝜑𝑥𝑋) → 𝐴𝑅)
1312ralrimiva 2508 . . 3 (𝜑 → ∀𝑥𝑋 𝐴𝑅)
143nfel1 2293 . . . 4 𝑥𝑦 / 𝑥𝐴𝑅
156eleq1d 2209 . . . 4 (𝑥 = 𝑦 → (𝐴𝑅𝑦 / 𝑥𝐴𝑅))
1614, 15rspc 2787 . . 3 (𝑦𝑋 → (∀𝑥𝑋 𝐴𝑅𝑦 / 𝑥𝐴𝑅))
1713, 16mpan9 279 . 2 ((𝜑𝑦𝑋) → 𝑦 / 𝑥𝐴𝑅)
18 flift.3 . . . 4 ((𝜑𝑥𝑋) → 𝐵𝑆)
1918ralrimiva 2508 . . 3 (𝜑 → ∀𝑥𝑋 𝐵𝑆)
204nfel1 2293 . . . 4 𝑥𝑦 / 𝑥𝐵𝑆
217eleq1d 2209 . . . 4 (𝑥 = 𝑦 → (𝐵𝑆𝑦 / 𝑥𝐵𝑆))
2220, 21rspc 2787 . . 3 (𝑦𝑋 → (∀𝑥𝑋 𝐵𝑆𝑦 / 𝑥𝐵𝑆))
2319, 22mpan9 279 . 2 ((𝜑𝑦𝑋) → 𝑦 / 𝑥𝐵𝑆)
24 csbeq1 3010 . 2 (𝑦 = 𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴)
25 csbeq1 3010 . 2 (𝑦 = 𝑧𝑦 / 𝑥𝐵 = 𝑧 / 𝑥𝐵)
2611, 17, 23, 24, 25fliftfun 5705 1 (𝜑 → (Fun 𝐹 ↔ ∀𝑦𝑋𝑧𝑋 (𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴𝑦 / 𝑥𝐵 = 𝑧 / 𝑥𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1332  wcel 1481  wral 2417  csb 3007  cop 3535  cmpt 3997  ran crn 4548  Fun wfun 5125
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-fv 5139
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator