| 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 6348, ot2ndg 6349, ot3rdgg 6350.) (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 3701 | . . . . 5 ⊢ 〈𝐴, 𝐵, 𝐶〉 = 〈〈𝐴, 𝐵〉, 𝐶〉 | |
| 2 | 1 | fveq2i 5675 | . . . 4 ⊢ (1st ‘〈𝐴, 𝐵, 𝐶〉) = (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) |
| 3 | opexg 4346 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐴, 𝐵〉 ∈ V) | |
| 4 | op1stg 6346 | . . . . . 6 ⊢ ((〈𝐴, 𝐵〉 ∈ V ∧ 𝐶 ∈ 𝑋) → (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) = 〈𝐴, 𝐵〉) | |
| 5 | 3, 4 | sylan 283 | . . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ 𝐶 ∈ 𝑋) → (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) = 〈𝐴, 𝐵〉) |
| 6 | 5 | 3impa 1221 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘〈〈𝐴, 𝐵〉, 𝐶〉) = 〈𝐴, 𝐵〉) |
| 7 | 2, 6 | eqtrid 2279 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘〈𝐴, 𝐵, 𝐶〉) = 〈𝐴, 𝐵〉) |
| 8 | 7 | fveq2d 5676 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘(1st ‘〈𝐴, 𝐵, 𝐶〉)) = (1st ‘〈𝐴, 𝐵〉)) |
| 9 | op1stg 6346 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (1st ‘〈𝐴, 𝐵〉) = 𝐴) | |
| 10 | 9 | 3adant3 1044 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘〈𝐴, 𝐵〉) = 𝐴) |
| 11 | 8, 10 | eqtrd 2267 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (1st ‘(1st ‘〈𝐴, 𝐵, 𝐶〉)) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2205 Vcvv 2815 〈cop 3694 〈cotp 3695 ‘cfv 5354 1st c1st 6334 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 df-rex 2528 df-v 2817 df-sbc 3045 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-ot 3701 df-uni 3917 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-iota 5314 df-fun 5356 df-fv 5362 df-1st 6336 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |