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

Theorem fliftval 7187
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 481 . 2 ((𝜑𝑌𝑋) → Fun 𝐹)
3 simpr 485 . . . 4 ((𝜑𝑌𝑋) → 𝑌𝑋)
4 eqidd 2739 . . . . 5 (𝜑𝐷 = 𝐷)
5 eqidd 2739 . . . . 5 (𝑌𝑋𝐶 = 𝐶)
64, 5anim12ci 614 . . . 4 ((𝜑𝑌𝑋) → (𝐶 = 𝐶𝐷 = 𝐷))
7 fliftval.4 . . . . . . 7 (𝑥 = 𝑌𝐴 = 𝐶)
87eqeq2d 2749 . . . . . 6 (𝑥 = 𝑌 → (𝐶 = 𝐴𝐶 = 𝐶))
9 fliftval.5 . . . . . . 7 (𝑥 = 𝑌𝐵 = 𝐷)
109eqeq2d 2749 . . . . . 6 (𝑥 = 𝑌 → (𝐷 = 𝐵𝐷 = 𝐷))
118, 10anbi12d 631 . . . . 5 (𝑥 = 𝑌 → ((𝐶 = 𝐴𝐷 = 𝐵) ↔ (𝐶 = 𝐶𝐷 = 𝐷)))
1211rspcev 3561 . . . 4 ((𝑌𝑋 ∧ (𝐶 = 𝐶𝐷 = 𝐷)) → ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵))
133, 6, 12syl2anc 584 . . 3 ((𝜑𝑌𝑋) → ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵))
14 flift.1 . . . . 5 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
15 flift.2 . . . . 5 ((𝜑𝑥𝑋) → 𝐴𝑅)
16 flift.3 . . . . 5 ((𝜑𝑥𝑋) → 𝐵𝑆)
1714, 15, 16fliftel 7180 . . . 4 (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵)))
1817adantr 481 . . 3 ((𝜑𝑌𝑋) → (𝐶𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵)))
1913, 18mpbird 256 . 2 ((𝜑𝑌𝑋) → 𝐶𝐹𝐷)
20 funbrfv 6820 . 2 (Fun 𝐹 → (𝐶𝐹𝐷 → (𝐹𝐶) = 𝐷))
212, 19, 20sylc 65 1 ((𝜑𝑌𝑋) → (𝐹𝐶) = 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wrex 3065  cop 4567   class class class wbr 5074  cmpt 5157  ran crn 5590  Fun wfun 6427  cfv 6433
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-iota 6391  df-fun 6435  df-fv 6441
This theorem is referenced by:  qliftval  8595  cygznlem2  20776  pi1xfrval  24217  pi1coval  24223
  Copyright terms: Public domain W3C validator