| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > f1stres | GIF version | ||
| Description: Mapping of a restriction of the 1st (first member of an ordered pair) function. (Contributed by NM, 11-Oct-2004.) (Revised by Mario Carneiro, 8-Sep-2013.) |
| Ref | Expression |
|---|---|
| f1stres | ⊢ (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 2776 | . . . . . . . 8 ⊢ 𝑦 ∈ V | |
| 2 | vex 2776 | . . . . . . . 8 ⊢ 𝑧 ∈ V | |
| 3 | 1, 2 | op1sta 5178 | . . . . . . 7 ⊢ ∪ dom {〈𝑦, 𝑧〉} = 𝑦 |
| 4 | 3 | eleq1i 2272 | . . . . . 6 ⊢ (∪ dom {〈𝑦, 𝑧〉} ∈ 𝐴 ↔ 𝑦 ∈ 𝐴) |
| 5 | 4 | biimpri 133 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 → ∪ dom {〈𝑦, 𝑧〉} ∈ 𝐴) |
| 6 | 5 | adantr 276 | . . . 4 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) → ∪ dom {〈𝑦, 𝑧〉} ∈ 𝐴) |
| 7 | 6 | rgen2 2593 | . . 3 ⊢ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∪ dom {〈𝑦, 𝑧〉} ∈ 𝐴 |
| 8 | sneq 3649 | . . . . . . 7 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → {𝑥} = {〈𝑦, 𝑧〉}) | |
| 9 | 8 | dmeqd 4894 | . . . . . 6 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → dom {𝑥} = dom {〈𝑦, 𝑧〉}) |
| 10 | 9 | unieqd 3870 | . . . . 5 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → ∪ dom {𝑥} = ∪ dom {〈𝑦, 𝑧〉}) |
| 11 | 10 | eleq1d 2275 | . . . 4 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → (∪ dom {𝑥} ∈ 𝐴 ↔ ∪ dom {〈𝑦, 𝑧〉} ∈ 𝐴)) |
| 12 | 11 | ralxp 4834 | . . 3 ⊢ (∀𝑥 ∈ (𝐴 × 𝐵)∪ dom {𝑥} ∈ 𝐴 ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∪ dom {〈𝑦, 𝑧〉} ∈ 𝐴) |
| 13 | 7, 12 | mpbir 146 | . 2 ⊢ ∀𝑥 ∈ (𝐴 × 𝐵)∪ dom {𝑥} ∈ 𝐴 |
| 14 | df-1st 6244 | . . . . 5 ⊢ 1st = (𝑥 ∈ V ↦ ∪ dom {𝑥}) | |
| 15 | 14 | reseq1i 4969 | . . . 4 ⊢ (1st ↾ (𝐴 × 𝐵)) = ((𝑥 ∈ V ↦ ∪ dom {𝑥}) ↾ (𝐴 × 𝐵)) |
| 16 | ssv 3219 | . . . . 5 ⊢ (𝐴 × 𝐵) ⊆ V | |
| 17 | resmpt 5021 | . . . . 5 ⊢ ((𝐴 × 𝐵) ⊆ V → ((𝑥 ∈ V ↦ ∪ dom {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ dom {𝑥})) | |
| 18 | 16, 17 | ax-mp 5 | . . . 4 ⊢ ((𝑥 ∈ V ↦ ∪ dom {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ dom {𝑥}) |
| 19 | 15, 18 | eqtri 2227 | . . 3 ⊢ (1st ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ dom {𝑥}) |
| 20 | 19 | fmpt 5748 | . 2 ⊢ (∀𝑥 ∈ (𝐴 × 𝐵)∪ dom {𝑥} ∈ 𝐴 ↔ (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴) |
| 21 | 13, 20 | mpbi 145 | 1 ⊢ (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1373 ∈ wcel 2177 ∀wral 2485 Vcvv 2773 ⊆ wss 3170 {csn 3638 〈cop 3641 ∪ cuni 3859 ↦ cmpt 4116 × cxp 4686 dom cdm 4688 ↾ cres 4690 ⟶wf 5281 1st c1st 6242 |
| 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 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-14 2180 ax-ext 2188 ax-sep 4173 ax-pow 4229 ax-pr 4264 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ral 2490 df-rex 2491 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-un 3174 df-in 3176 df-ss 3183 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3860 df-iun 3938 df-br 4055 df-opab 4117 df-mpt 4118 df-id 4353 df-xp 4694 df-rel 4695 df-cnv 4696 df-co 4697 df-dm 4698 df-rn 4699 df-res 4700 df-ima 4701 df-iota 5246 df-fun 5287 df-fn 5288 df-f 5289 df-fv 5293 df-1st 6244 |
| This theorem is referenced by: fo1stresm 6265 1stcof 6267 tx1cn 14826 |
| Copyright terms: Public domain | W3C validator |