| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ot1stg | GIF version | ||
| Description: Extract the first member of an ordered triple. (Due to infrequent usage, it isn't worthwhile at this point to define special extractors for triples, so we reuse the ordered pair extractors for ot1stg 6240, ot2ndg 6241, ot3rdgg 6242.) (Contributed by NM, 3-Apr-2015.) (Revised by Mario Carneiro, 2-May-2015.) |
| Ref | Expression |
|---|---|
| ot1stg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘(1st ‘〈𝐴, 𝐵, 𝐶〉)) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ot 3643 | . . . . 5 ⊢ 〈𝐴, 𝐵, 𝐶〉 = 〈〈𝐴, 𝐵〉, 𝐶〉 | |
| 2 | 1 | fveq2i 5581 | . . . 4 ⊢ (1st ‘〈𝐴, 𝐵, 𝐶〉) = (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) |
| 3 | opexg 4273 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐴, 𝐵〉 ∈ V) | |
| 4 | op1stg 6238 | . . . . . 6 ⊢ ((〈𝐴, 𝐵〉 ∈ V ∧ 𝐶 ∈ 𝑋) → (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) = 〈𝐴, 𝐵〉) | |
| 5 | 3, 4 | sylan 283 | . . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ 𝐶 ∈ 𝑋) → (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) = 〈𝐴, 𝐵〉) |
| 6 | 5 | 3impa 1197 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) = 〈𝐴, 𝐵〉) |
| 7 | 2, 6 | eqtrid 2250 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘〈𝐴, 𝐵, 𝐶〉) = 〈𝐴, 𝐵〉) |
| 8 | 7 | fveq2d 5582 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘(1st ‘〈𝐴, 𝐵, 𝐶〉)) = (1st ‘〈𝐴, 𝐵〉)) |
| 9 | op1stg 6238 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (1st ‘〈𝐴, 𝐵〉) = 𝐴) | |
| 10 | 9 | 3adant3 1020 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘〈𝐴, 𝐵〉) = 𝐴) |
| 11 | 8, 10 | eqtrd 2238 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘(1st ‘〈𝐴, 𝐵, 𝐶〉)) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 981 = wceq 1373 ∈ wcel 2176 Vcvv 2772 〈cop 3636 〈cotp 3637 ‘cfv 5272 1st c1st 6226 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-sep 4163 ax-pow 4219 ax-pr 4254 ax-un 4481 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ral 2489 df-rex 2490 df-v 2774 df-sbc 2999 df-un 3170 df-in 3172 df-ss 3179 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-ot 3643 df-uni 3851 df-br 4046 df-opab 4107 df-mpt 4108 df-id 4341 df-xp 4682 df-rel 4683 df-cnv 4684 df-co 4685 df-dm 4686 df-rn 4687 df-iota 5233 df-fun 5274 df-fv 5280 df-1st 6228 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |