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

Theorem fliftval 7051
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 484 . 2 ((𝜑𝑌𝑋) → Fun 𝐹)
3 simpr 488 . . . 4 ((𝜑𝑌𝑋) → 𝑌𝑋)
4 eqidd 2825 . . . . 5 (𝜑𝐷 = 𝐷)
5 eqidd 2825 . . . . 5 (𝑌𝑋𝐶 = 𝐶)
64, 5anim12ci 616 . . . 4 ((𝜑𝑌𝑋) → (𝐶 = 𝐶𝐷 = 𝐷))
7 fliftval.4 . . . . . . 7 (𝑥 = 𝑌𝐴 = 𝐶)
87eqeq2d 2835 . . . . . 6 (𝑥 = 𝑌 → (𝐶 = 𝐴𝐶 = 𝐶))
9 fliftval.5 . . . . . . 7 (𝑥 = 𝑌𝐵 = 𝐷)
109eqeq2d 2835 . . . . . 6 (𝑥 = 𝑌 → (𝐷 = 𝐵𝐷 = 𝐷))
118, 10anbi12d 633 . . . . 5 (𝑥 = 𝑌 → ((𝐶 = 𝐴𝐷 = 𝐵) ↔ (𝐶 = 𝐶𝐷 = 𝐷)))
1211rspcev 3608 . . . 4 ((𝑌𝑋 ∧ (𝐶 = 𝐶𝐷 = 𝐷)) → ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵))
133, 6, 12syl2anc 587 . . 3 ((𝜑𝑌𝑋) → ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵))
14 flift.1 . . . . 5 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
15 flift.2 . . . . 5 ((𝜑𝑥𝑋) → 𝐴𝑅)
16 flift.3 . . . . 5 ((𝜑𝑥𝑋) → 𝐵𝑆)
1714, 15, 16fliftel 7044 . . . 4 (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵)))
1817adantr 484 . . 3 ((𝜑𝑌𝑋) → (𝐶𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵)))
1913, 18mpbird 260 . 2 ((𝜑𝑌𝑋) → 𝐶𝐹𝐷)
20 funbrfv 6697 . 2 (Fun 𝐹 → (𝐶𝐹𝐷 → (𝐹𝐶) = 𝐷))
212, 19, 20sylc 65 1 ((𝜑𝑌𝑋) → (𝐹𝐶) = 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2115  wrex 3133  cop 4554   class class class wbr 5047  cmpt 5127  ran crn 5537  Fun wfun 6330  cfv 6336
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-sep 5184  ax-nul 5191  ax-pr 5311
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ral 3137  df-rex 3138  df-rab 3141  df-v 3481  df-sbc 3758  df-dif 3921  df-un 3923  df-in 3925  df-ss 3935  df-nul 4275  df-if 4449  df-sn 4549  df-pr 4551  df-op 4555  df-uni 4820  df-br 5048  df-opab 5110  df-mpt 5128  df-id 5441  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-iota 6295  df-fun 6338  df-fv 6344
This theorem is referenced by:  qliftval  8369  cygznlem2  20701  pi1xfrval  23648  pi1coval  23654
  Copyright terms: Public domain W3C validator