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

Theorem fliftfuns 6004
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 2392 . . . . 5 Ⅎ𝑦⟨𝐴, 𝐵⟩
3 nfcsb1v 3180 . . . . . 6 Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐴
4 nfcsb1v 3180 . . . . . 6 Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵
53, 4nfop 3920 . . . . 5 Ⅎ𝑥⟨⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵⟩
6 csbeq1a 3156 . . . . . 6 (𝑥 = 𝑦 → 𝐴 = ⦋𝑦 / 𝑥⦌𝐴)
7 csbeq1a 3156 . . . . . 6 (𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵)
86, 7opeq12d 3912 . . . . 5 (𝑥 = 𝑦 → ⟨𝐴, 𝐵⟩ = ⟨⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵⟩)
92, 5, 8cbvmpt 4226 . . . 4 (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩) = (𝑦 ∈ 𝑋 ↦ ⟨⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵⟩)
109rneqi 5010 . . 3 ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩) = ran (𝑦 ∈ 𝑋 ↦ ⟨⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵⟩)
111, 10eqtri 2259 . 2 𝐹 = ran (𝑦 ∈ 𝑋 ↦ ⟨⦋𝑦 / 𝑥⦌𝐴, ⦋𝑦 / 𝑥⦌𝐵⟩)
12 flift.2 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅)
1312ralrimiva 2623 . . 3 (𝜑 → ∀𝑥 ∈ 𝑋 𝐴 ∈ 𝑅)
143nfel1 2403 . . . 4 Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅
156eleq1d 2307 . . . 4 (𝑥 = 𝑦 → (𝐴 ∈ 𝑅 ↔ ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅))
1614, 15rspc 2923 . . 3 (𝑦 ∈ 𝑋 → (∀𝑥 ∈ 𝑋 𝐴 ∈ 𝑅 → ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅))
1713, 16mpan9 281 . 2 ((𝜑 ∧ 𝑦 ∈ 𝑋) → ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝑅)
18 flift.3 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆)
1918ralrimiva 2623 . . 3 (𝜑 → ∀𝑥 ∈ 𝑋 𝐵 ∈ 𝑆)
204nfel1 2403 . . . 4 Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆
217eleq1d 2307 . . . 4 (𝑥 = 𝑦 → (𝐵 ∈ 𝑆 ↔ ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆))
2220, 21rspc 2923 . . 3 (𝑦 ∈ 𝑋 → (∀𝑥 ∈ 𝑋 𝐵 ∈ 𝑆 → ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆))
2319, 22mpan9 281 . 2 ((𝜑 ∧ 𝑦 ∈ 𝑋) → ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝑆)
24 csbeq1 3150 . 2 (𝑦 = 𝑧 → ⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴)
25 csbeq1 3150 . 2 (𝑦 = 𝑧 → ⦋𝑦 / 𝑥⦌𝐵 = ⦋𝑧 / 𝑥⦌𝐵)
2611, 17, 23, 24, 25fliftfun 6002 1 (𝜑 → (Fun 𝐹 ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (⦋𝑦 / 𝑥⦌𝐴 = ⦋𝑧 / 𝑥⦌𝐴 → ⦋𝑦 / 𝑥⦌𝐵 = ⦋𝑧 / 𝑥⦌𝐵)))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ⦋csb 3147  ⟨cop 3712   ↦ cmpt 4192  ran crn 4775  Fun wfun 5371
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator