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

Theorem fliftval 6466
Description: The value of the function 𝐹. (Contributed by Mario Carneiro, 23-Dec-2016.)
Hypotheses
Ref Expression
flift.1 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
flift.2 ((𝜑𝑥𝑋) → 𝐴𝑅)
flift.3 ((𝜑𝑥𝑋) → 𝐵𝑆)
fliftval.4 (𝑥 = 𝑌𝐴 = 𝐶)
fliftval.5 (𝑥 = 𝑌𝐵 = 𝐷)
fliftval.6 (𝜑 → Fun 𝐹)
Assertion
Ref Expression
fliftval ((𝜑𝑌𝑋) → (𝐹𝐶) = 𝐷)
Distinct variable groups:   𝑥,𝐶   𝑥,𝑅   𝑥,𝑌   𝑥,𝐷   𝜑,𝑥   𝑥,𝑋   𝑥,𝑆
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem fliftval
StepHypRef Expression
1 fliftval.6 . . 3 (𝜑 → Fun 𝐹)
21adantr 480 . 2 ((𝜑𝑌𝑋) → Fun 𝐹)
3 simpr 476 . . . 4 ((𝜑𝑌𝑋) → 𝑌𝑋)
4 eqidd 2611 . . . . 5 (𝜑𝐷 = 𝐷)
5 eqidd 2611 . . . . 5 (𝑌𝑋𝐶 = 𝐶)
64, 5anim12ci 589 . . . 4 ((𝜑𝑌𝑋) → (𝐶 = 𝐶𝐷 = 𝐷))
7 fliftval.4 . . . . . . 7 (𝑥 = 𝑌𝐴 = 𝐶)
87eqeq2d 2620 . . . . . 6 (𝑥 = 𝑌 → (𝐶 = 𝐴𝐶 = 𝐶))
9 fliftval.5 . . . . . . 7 (𝑥 = 𝑌𝐵 = 𝐷)
109eqeq2d 2620 . . . . . 6 (𝑥 = 𝑌 → (𝐷 = 𝐵𝐷 = 𝐷))
118, 10anbi12d 743 . . . . 5 (𝑥 = 𝑌 → ((𝐶 = 𝐴𝐷 = 𝐵) ↔ (𝐶 = 𝐶𝐷 = 𝐷)))
1211rspcev 3282 . . . 4 ((𝑌𝑋 ∧ (𝐶 = 𝐶𝐷 = 𝐷)) → ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵))
133, 6, 12syl2anc 691 . . 3 ((𝜑𝑌𝑋) → ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵))
14 flift.1 . . . . 5 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
15 flift.2 . . . . 5 ((𝜑𝑥𝑋) → 𝐴𝑅)
16 flift.3 . . . . 5 ((𝜑𝑥𝑋) → 𝐵𝑆)
1714, 15, 16fliftel 6459 . . . 4 (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵)))
1817adantr 480 . . 3 ((𝜑𝑌𝑋) → (𝐶𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵)))
1913, 18mpbird 246 . 2 ((𝜑𝑌𝑋) → 𝐶𝐹𝐷)
20 funbrfv 6144 . 2 (Fun 𝐹 → (𝐶𝐹𝐷 → (𝐹𝐶) = 𝐷))
212, 19, 20sylc 63 1 ((𝜑𝑌𝑋) → (𝐹𝐶) = 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  wrex 2897  cop 4131   class class class wbr 4583  cmpt 4643  ran crn 5039  Fun wfun 5798  cfv 5804
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-iota 5768  df-fun 5806  df-fv 5812
This theorem is referenced by:  qliftval  7723  cygznlem2  19736  pi1xfrval  22662  pi1coval  22668
  Copyright terms: Public domain W3C validator