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

Theorem fliftval 7071
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 483 . 2 ((𝜑𝑌𝑋) → Fun 𝐹)
3 simpr 487 . . . 4 ((𝜑𝑌𝑋) → 𝑌𝑋)
4 eqidd 2824 . . . . 5 (𝜑𝐷 = 𝐷)
5 eqidd 2824 . . . . 5 (𝑌𝑋𝐶 = 𝐶)
64, 5anim12ci 615 . . . 4 ((𝜑𝑌𝑋) → (𝐶 = 𝐶𝐷 = 𝐷))
7 fliftval.4 . . . . . . 7 (𝑥 = 𝑌𝐴 = 𝐶)
87eqeq2d 2834 . . . . . 6 (𝑥 = 𝑌 → (𝐶 = 𝐴𝐶 = 𝐶))
9 fliftval.5 . . . . . . 7 (𝑥 = 𝑌𝐵 = 𝐷)
109eqeq2d 2834 . . . . . 6 (𝑥 = 𝑌 → (𝐷 = 𝐵𝐷 = 𝐷))
118, 10anbi12d 632 . . . . 5 (𝑥 = 𝑌 → ((𝐶 = 𝐴𝐷 = 𝐵) ↔ (𝐶 = 𝐶𝐷 = 𝐷)))
1211rspcev 3625 . . . 4 ((𝑌𝑋 ∧ (𝐶 = 𝐶𝐷 = 𝐷)) → ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵))
133, 6, 12syl2anc 586 . . 3 ((𝜑𝑌𝑋) → ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵))
14 flift.1 . . . . 5 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
15 flift.2 . . . . 5 ((𝜑𝑥𝑋) → 𝐴𝑅)
16 flift.3 . . . . 5 ((𝜑𝑥𝑋) → 𝐵𝑆)
1714, 15, 16fliftel 7064 . . . 4 (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵)))
1817adantr 483 . . 3 ((𝜑𝑌𝑋) → (𝐶𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵)))
1913, 18mpbird 259 . 2 ((𝜑𝑌𝑋) → 𝐶𝐹𝐷)
20 funbrfv 6718 . 2 (Fun 𝐹 → (𝐶𝐹𝐷 → (𝐹𝐶) = 𝐷))
212, 19, 20sylc 65 1 ((𝜑𝑌𝑋) → (𝐹𝐶) = 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1537  wcel 2114  wrex 3141  cop 4575   class class class wbr 5068  cmpt 5148  ran crn 5558  Fun wfun 6351  cfv 6357
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-iota 6316  df-fun 6359  df-fv 6365
This theorem is referenced by:  qliftval  8388  cygznlem2  20717  pi1xfrval  23660  pi1coval  23666
  Copyright terms: Public domain W3C validator