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

Theorem fliftval 7347
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 2764 . . . . 5 (𝜑 → 𝐷 = 𝐷)
5 eqidd 2764 . . . . 5 (𝑌 ∈ 𝑋 → 𝐶 = 𝐶)
64, 5anim12ci 626 . . . 4 ((𝜑 ∧ 𝑌 ∈ 𝑋) → (𝐶 = 𝐶 ∧ 𝐷 = 𝐷))
7 fliftval.4 . . . . . . 7 (𝑥 = 𝑌 → 𝐴 = 𝐶)
87eqeq2d 2774 . . . . . 6 (𝑥 = 𝑌 → (𝐶 = 𝐴 ↔ 𝐶 = 𝐶))
9 fliftval.5 . . . . . . 7 (𝑥 = 𝑌 → 𝐵 = 𝐷)
109eqeq2d 2774 . . . . . 6 (𝑥 = 𝑌 → (𝐷 = 𝐵 ↔ 𝐷 = 𝐷))
118, 10anbi12d 644 . . . . 5 (𝑥 = 𝑌 → ((𝐶 = 𝐴 ∧ 𝐷 = 𝐵) ↔ (𝐶 = 𝐶 ∧ 𝐷 = 𝐷)))
1211rspcev 3580 . . . 4 ((𝑌 ∈ 𝑋 ∧ (𝐶 = 𝐶 ∧ 𝐷 = 𝐷)) → ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))
133, 6, 12syl2anc 596 . . 3 ((𝜑 ∧ 𝑌 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))
14 flift.1 . . . . 5 𝐹 = ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩)
15 flift.2 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅)
16 flift.3 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆)
1714, 15, 16fliftel 7340 . . . 4 (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
1817adantr 486 . . 3 ((𝜑 ∧ 𝑌 ∈ 𝑋) → (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
1913, 18mpbird 260 . 2 ((𝜑 ∧ 𝑌 ∈ 𝑋) → 𝐶𝐹𝐷)
20 funbrfv 6956 . 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 2147  ∃wrex 3090  ⟨cop 4838   class class class wbr 5106   ↦ cmpt 5189  ran crn 5656  Fun wfun 6552  ‘cfv 6558
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-pr 5395
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6512  df-fun 6560  df-fv 6566
This theorem is used by:  qliftval  8855  cygznlem2  21904  pi1xfrval  25405  pi1coval  25411
  Copyright terms: Public domain W3C validator