| 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 6379, ot2ndg 6380, ot3rdgg 6381.) (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 3718 | . . . . 5 ⊢ 〈𝐴, 𝐵, 𝐶〉 = 〈〈𝐴, 𝐵〉, 𝐶〉 | |
| 2 | 1 | fveq2i 5696 | . . . 4 ⊢ (1st ‘〈𝐴, 𝐵, 𝐶〉) = (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) |
| 3 | opexg 4366 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐴, 𝐵〉 ∈ V) | |
| 4 | op1stg 6377 | . . . . . 6 ⊢ ((〈𝐴, 𝐵〉 ∈ V ∧ 𝐶 ∈ 𝑋) → (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) = 〈𝐴, 𝐵〉) | |
| 5 | 3, 4 | sylan 283 | . . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ 𝐶 ∈ 𝑋) → (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) = 〈𝐴, 𝐵〉) |
| 6 | 5 | 3impa 1225 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) = 〈𝐴, 𝐵〉) |
| 7 | 2, 6 | eqtrid 2283 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘〈𝐴, 𝐵, 𝐶〉) = 〈𝐴, 𝐵〉) |
| 8 | 7 | fveq2d 5697 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘(1st ‘〈𝐴, 𝐵, 𝐶〉)) = (1st ‘〈𝐴, 𝐵〉)) |
| 9 | op1stg 6377 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (1st ‘〈𝐴, 𝐵〉) = 𝐴) | |
| 10 | 9 | 3adant3 1048 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘〈𝐴, 𝐵〉) = 𝐴) |
| 11 | 8, 10 | eqtrd 2271 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘(1st ‘〈𝐴, 𝐵, 𝐶〉)) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 Vcvv 2821 〈cop 3711 〈cotp 3712 ‘cfv 5375 1st c1st 6365 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-ot 3718 df-uni 3934 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-iota 5335 df-fun 5377 df-fv 5383 df-1st 6367 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |