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

Theorem fliftval 7316
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 486 . 2 ((𝜑 ∧ 𝑌 ∈ 𝑋) → Fun 𝐹)
3 simpr 490 . . . 4 ((𝜑 ∧ 𝑌 ∈ 𝑋) → 𝑌 ∈ 𝑋)
4 eqidd 2762 . . . . 5 (𝜑 → 𝐷 = 𝐷)
5 eqidd 2762 . . . . 5 (𝑌 ∈ 𝑋 → 𝐶 = 𝐶)
64, 5anim12ci 626 . . . 4 ((𝜑 ∧ 𝑌 ∈ 𝑋) → (𝐶 = 𝐶 ∧ 𝐷 = 𝐷))
7 fliftval.4 . . . . . . 7 (𝑥 = 𝑌 → 𝐴 = 𝐶)
87eqeq2d 2772 . . . . . 6 (𝑥 = 𝑌 → (𝐶 = 𝐴 ↔ 𝐶 = 𝐶))
9 fliftval.5 . . . . . . 7 (𝑥 = 𝑌 → 𝐵 = 𝐷)
109eqeq2d 2772 . . . . . 6 (𝑥 = 𝑌 → (𝐷 = 𝐵 ↔ 𝐷 = 𝐷))
118, 10anbi12d 644 . . . . 5 (𝑥 = 𝑌 → ((𝐶 = 𝐴 ∧ 𝐷 = 𝐵) ↔ (𝐶 = 𝐶 ∧ 𝐷 = 𝐷)))
1211rspcev 3577 . . . 4 ((𝑌 ∈ 𝑋 ∧ (𝐶 = 𝐶 ∧ 𝐷 = 𝐷)) → ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))
133, 6, 12syl2anc 596 . . 3 ((𝜑 ∧ 𝑌 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))
14 flift.1 . . . . 5 𝐹 = ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩)
15 flift.2 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅)
16 flift.3 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆)
1714, 15, 16fliftel 7309 . . . 4 (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
1817adantr 486 . . 3 ((𝜑 ∧ 𝑌 ∈ 𝑋) → (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
1913, 18mpbird 260 . 2 ((𝜑 ∧ 𝑌 ∈ 𝑋) → 𝐶𝐹𝐷)
20 funbrfv 6925 . 2 (Fun 𝐹 → (𝐶𝐹𝐷 → (𝐹‘𝐶) = 𝐷))
212, 19, 20sylc 66 1 ((𝜑 ∧ 𝑌 ∈ 𝑋) → (𝐹‘𝐶) = 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  ⟨cop 4590   class class class wbr 5103   ↦ cmpt 5186  ran crn 5652  Fun wfun 6525  ‘cfv 6531
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6487  df-fun 6533  df-fv 6539
This theorem is used by:  qliftval  8811  cygznlem2  21854  pi1xfrval  25355  pi1coval  25361
  Copyright terms: Public domain W3C validator