| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fliftval | Structured version Visualization version GIF version | ||
| Description: The value of the function 𝐹. (Contributed by Mario Carneiro, 23-Dec-2016.) |
| Ref | Expression |
|---|---|
| flift.1 | ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) |
| flift.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅) |
| flift.3 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆) |
| fliftval.4 | ⊢ (𝑥 = 𝑌 → 𝐴 = 𝐶) |
| fliftval.5 | ⊢ (𝑥 = 𝑌 → 𝐵 = 𝐷) |
| fliftval.6 | ⊢ (𝜑 → Fun 𝐹) |
| Ref | Expression |
|---|---|
| fliftval | ⊢ ((𝜑 ∧ 𝑌 ∈ 𝑋) → (𝐹‘𝐶) = 𝐷) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fliftval.6 | . . 3 ⊢ (𝜑 → Fun 𝐹) | |
| 2 | 1 | adantr 486 | . 2 ⊢ ((𝜑 ∧ 𝑌 ∈ 𝑋) → Fun 𝐹) |
| 3 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑌 ∈ 𝑋) → 𝑌 ∈ 𝑋) | |
| 4 | eqidd 2763 | . . . . 5 ⊢ (𝜑 → 𝐷 = 𝐷) | |
| 5 | eqidd 2763 | . . . . 5 ⊢ (𝑌 ∈ 𝑋 → 𝐶 = 𝐶) | |
| 6 | 4, 5 | anim12ci 626 | . . . 4 ⊢ ((𝜑 ∧ 𝑌 ∈ 𝑋) → (𝐶 = 𝐶 ∧ 𝐷 = 𝐷)) |
| 7 | fliftval.4 | . . . . . . 7 ⊢ (𝑥 = 𝑌 → 𝐴 = 𝐶) | |
| 8 | 7 | eqeq2d 2773 | . . . . . 6 ⊢ (𝑥 = 𝑌 → (𝐶 = 𝐴 ↔ 𝐶 = 𝐶)) |
| 9 | fliftval.5 | . . . . . . 7 ⊢ (𝑥 = 𝑌 → 𝐵 = 𝐷) | |
| 10 | 9 | eqeq2d 2773 | . . . . . 6 ⊢ (𝑥 = 𝑌 → (𝐷 = 𝐵 ↔ 𝐷 = 𝐷)) |
| 11 | 8, 10 | anbi12d 644 | . . . . 5 ⊢ (𝑥 = 𝑌 → ((𝐶 = 𝐴 ∧ 𝐷 = 𝐵) ↔ (𝐶 = 𝐶 ∧ 𝐷 = 𝐷))) |
| 12 | 11 | rspcev 3579 | . . . 4 ⊢ ((𝑌 ∈ 𝑋 ∧ (𝐶 = 𝐶 ∧ 𝐷 = 𝐷)) → ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)) |
| 13 | 3, 6, 12 | syl2anc 596 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)) |
| 14 | flift.1 | . . . . 5 ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) | |
| 15 | flift.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅) | |
| 16 | flift.3 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆) | |
| 17 | 14, 15, 16 | fliftel 7314 | . . . 4 ⊢ (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))) |
| 18 | 17 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ 𝑋) → (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))) |
| 19 | 13, 18 | mpbird 260 | . 2 ⊢ ((𝜑 ∧ 𝑌 ∈ 𝑋) → 𝐶𝐹𝐷) |
| 20 | funbrfv 6930 | . 2 ⊢ (Fun 𝐹 → (𝐶𝐹𝐷 → (𝐹‘𝐶) = 𝐷)) | |
| 21 | 2, 19, 20 | sylc 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 3088 〈cop 4593 class class class wbr 5107 ↦ cmpt 5190 ran crn 5660 Fun wfun 6531 ‘cfv 6537 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-iota 6493 df-fun 6539 df-fv 6545 |
| This theorem is used by: qliftval 8810 cygznlem2 21787 pi1xfrval 25288 pi1coval 25294 |
| Copyright terms: Public domain | W3C validator |