MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fliftf Structured version   Visualization version   GIF version

Theorem fliftf 7255
Description: The domain and range of the function 𝐹. (Contributed by Mario Carneiro, 23-Dec-2016.)
Hypotheses
Ref Expression
flift.1 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
flift.2 ((𝜑𝑥𝑋) → 𝐴𝑅)
flift.3 ((𝜑𝑥𝑋) → 𝐵𝑆)
Assertion
Ref Expression
fliftf (𝜑 → (Fun 𝐹𝐹:ran (𝑥𝑋𝐴)⟶𝑆))
Distinct variable groups:   𝑥,𝑅   𝜑,𝑥   𝑥,𝑋   𝑥,𝑆
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem fliftf
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 484 . . . . 5 ((𝜑 ∧ Fun 𝐹) → Fun 𝐹)
2 flift.1 . . . . . . . . . . 11 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
3 flift.2 . . . . . . . . . . 11 ((𝜑𝑥𝑋) → 𝐴𝑅)
4 flift.3 . . . . . . . . . . 11 ((𝜑𝑥𝑋) → 𝐵𝑆)
52, 3, 4fliftel 7249 . . . . . . . . . 10 (𝜑 → (𝑦𝐹𝑧 ↔ ∃𝑥𝑋 (𝑦 = 𝐴𝑧 = 𝐵)))
65exbidv 1922 . . . . . . . . 9 (𝜑 → (∃𝑧 𝑦𝐹𝑧 ↔ ∃𝑧𝑥𝑋 (𝑦 = 𝐴𝑧 = 𝐵)))
76adantr 480 . . . . . . . 8 ((𝜑 ∧ Fun 𝐹) → (∃𝑧 𝑦𝐹𝑧 ↔ ∃𝑧𝑥𝑋 (𝑦 = 𝐴𝑧 = 𝐵)))
8 rexcom4 3260 . . . . . . . . 9 (∃𝑥𝑋𝑧(𝑦 = 𝐴𝑧 = 𝐵) ↔ ∃𝑧𝑥𝑋 (𝑦 = 𝐴𝑧 = 𝐵))
9 19.42v 1954 . . . . . . . . . . . 12 (∃𝑧(𝑦 = 𝐴𝑧 = 𝐵) ↔ (𝑦 = 𝐴 ∧ ∃𝑧 𝑧 = 𝐵))
10 elisset 2815 . . . . . . . . . . . . . 14 (𝐵𝑆 → ∃𝑧 𝑧 = 𝐵)
114, 10syl 17 . . . . . . . . . . . . 13 ((𝜑𝑥𝑋) → ∃𝑧 𝑧 = 𝐵)
1211biantrud 531 . . . . . . . . . . . 12 ((𝜑𝑥𝑋) → (𝑦 = 𝐴 ↔ (𝑦 = 𝐴 ∧ ∃𝑧 𝑧 = 𝐵)))
139, 12bitr4id 290 . . . . . . . . . . 11 ((𝜑𝑥𝑋) → (∃𝑧(𝑦 = 𝐴𝑧 = 𝐵) ↔ 𝑦 = 𝐴))
1413rexbidva 3155 . . . . . . . . . 10 (𝜑 → (∃𝑥𝑋𝑧(𝑦 = 𝐴𝑧 = 𝐵) ↔ ∃𝑥𝑋 𝑦 = 𝐴))
1514adantr 480 . . . . . . . . 9 ((𝜑 ∧ Fun 𝐹) → (∃𝑥𝑋𝑧(𝑦 = 𝐴𝑧 = 𝐵) ↔ ∃𝑥𝑋 𝑦 = 𝐴))
168, 15bitr3id 285 . . . . . . . 8 ((𝜑 ∧ Fun 𝐹) → (∃𝑧𝑥𝑋 (𝑦 = 𝐴𝑧 = 𝐵) ↔ ∃𝑥𝑋 𝑦 = 𝐴))
177, 16bitrd 279 . . . . . . 7 ((𝜑 ∧ Fun 𝐹) → (∃𝑧 𝑦𝐹𝑧 ↔ ∃𝑥𝑋 𝑦 = 𝐴))
1817abbidv 2799 . . . . . 6 ((𝜑 ∧ Fun 𝐹) → {𝑦 ∣ ∃𝑧 𝑦𝐹𝑧} = {𝑦 ∣ ∃𝑥𝑋 𝑦 = 𝐴})
19 df-dm 5629 . . . . . 6 dom 𝐹 = {𝑦 ∣ ∃𝑧 𝑦𝐹𝑧}
20 eqid 2733 . . . . . . 7 (𝑥𝑋𝐴) = (𝑥𝑋𝐴)
2120rnmpt 5901 . . . . . 6 ran (𝑥𝑋𝐴) = {𝑦 ∣ ∃𝑥𝑋 𝑦 = 𝐴}
2218, 19, 213eqtr4g 2793 . . . . 5 ((𝜑 ∧ Fun 𝐹) → dom 𝐹 = ran (𝑥𝑋𝐴))
23 df-fn 6489 . . . . 5 (𝐹 Fn ran (𝑥𝑋𝐴) ↔ (Fun 𝐹 ∧ dom 𝐹 = ran (𝑥𝑋𝐴)))
241, 22, 23sylanbrc 583 . . . 4 ((𝜑 ∧ Fun 𝐹) → 𝐹 Fn ran (𝑥𝑋𝐴))
252, 3, 4fliftrel 7248 . . . . . . 7 (𝜑𝐹 ⊆ (𝑅 × 𝑆))
2625adantr 480 . . . . . 6 ((𝜑 ∧ Fun 𝐹) → 𝐹 ⊆ (𝑅 × 𝑆))
27 rnss 5883 . . . . . 6 (𝐹 ⊆ (𝑅 × 𝑆) → ran 𝐹 ⊆ ran (𝑅 × 𝑆))
2826, 27syl 17 . . . . 5 ((𝜑 ∧ Fun 𝐹) → ran 𝐹 ⊆ ran (𝑅 × 𝑆))
29 rnxpss 6124 . . . . 5 ran (𝑅 × 𝑆) ⊆ 𝑆
3028, 29sstrdi 3943 . . . 4 ((𝜑 ∧ Fun 𝐹) → ran 𝐹𝑆)
31 df-f 6490 . . . 4 (𝐹:ran (𝑥𝑋𝐴)⟶𝑆 ↔ (𝐹 Fn ran (𝑥𝑋𝐴) ∧ ran 𝐹𝑆))
3224, 30, 31sylanbrc 583 . . 3 ((𝜑 ∧ Fun 𝐹) → 𝐹:ran (𝑥𝑋𝐴)⟶𝑆)
3332ex 412 . 2 (𝜑 → (Fun 𝐹𝐹:ran (𝑥𝑋𝐴)⟶𝑆))
34 ffun 6659 . 2 (𝐹:ran (𝑥𝑋𝐴)⟶𝑆 → Fun 𝐹)
3533, 34impbid1 225 1 (𝜑 → (Fun 𝐹𝐹:ran (𝑥𝑋𝐴)⟶𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wex 1780  wcel 2113  {cab 2711  wrex 3057  wss 3898  cop 4581   class class class wbr 5093  cmpt 5174   × cxp 5617  dom cdm 5619  ran crn 5620  Fun wfun 6480   Fn wfn 6481  wf 6482
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pr 5372
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-sn 4576  df-pr 4578  df-op 4582  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-fun 6488  df-fn 6489  df-f 6490
This theorem is referenced by:  qliftf  8735  cygznlem2a  21506  pi1xfrf  24981  pi1cof  24987
  Copyright terms: Public domain W3C validator