Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fliftel | Structured version Visualization version GIF version |
Description: Elementhood in the relation 𝐹. (Contributed by Mario Carneiro, 23-Dec-2016.) |
Ref | Expression |
---|---|
flift.1 | ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) |
flift.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅) |
flift.3 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆) |
Ref | Expression |
---|---|
fliftel | ⊢ (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-br 5070 | . . 3 ⊢ (𝐶𝐹𝐷 ↔ 〈𝐶, 𝐷〉 ∈ 𝐹) | |
2 | flift.1 | . . . 4 ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) | |
3 | 2 | eleq2i 2907 | . . 3 ⊢ (〈𝐶, 𝐷〉 ∈ 𝐹 ↔ 〈𝐶, 𝐷〉 ∈ ran (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉)) |
4 | eqid 2824 | . . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) = (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) | |
5 | opex 5359 | . . . 4 ⊢ 〈𝐴, 𝐵〉 ∈ V | |
6 | 4, 5 | elrnmpti 5835 | . . 3 ⊢ (〈𝐶, 𝐷〉 ∈ ran (𝑥 ∈ 𝑋 ↦ 〈𝐴, 𝐵〉) ↔ ∃𝑥 ∈ 𝑋 〈𝐶, 𝐷〉 = 〈𝐴, 𝐵〉) |
7 | 1, 3, 6 | 3bitri 299 | . 2 ⊢ (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 〈𝐶, 𝐷〉 = 〈𝐴, 𝐵〉) |
8 | flift.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅) | |
9 | flift.3 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆) | |
10 | opthg2 5374 | . . . 4 ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) → (〈𝐶, 𝐷〉 = 〈𝐴, 𝐵〉 ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))) | |
11 | 8, 9, 10 | syl2anc 586 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (〈𝐶, 𝐷〉 = 〈𝐴, 𝐵〉 ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))) |
12 | 11 | rexbidva 3299 | . 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝑋 〈𝐶, 𝐷〉 = 〈𝐴, 𝐵〉 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))) |
13 | 7, 12 | syl5bb 285 | 1 ⊢ (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ∃wrex 3142 〈cop 4576 class class class wbr 5069 ↦ cmpt 5149 ran crn 5559 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-br 5070 df-opab 5132 df-mpt 5150 df-cnv 5566 df-dm 5568 df-rn 5569 |
This theorem is referenced by: fliftcnv 7067 fliftfun 7068 fliftf 7071 fliftval 7072 qliftel 8383 |
Copyright terms: Public domain | W3C validator |