| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > djuf1olem | GIF version | ||
| Description: Lemma for djulf1o 7133 and djurf1o 7134. (Contributed by BJ and Jim Kingdon, 4-Jul-2022.) |
| Ref | Expression |
|---|---|
| djuf1olem.1 | ⊢ 𝑋 ∈ V |
| djuf1olem.2 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 〈𝑋, 𝑥〉) |
| Ref | Expression |
|---|---|
| djuf1olem | ⊢ 𝐹:𝐴–1-1-onto→({𝑋} × 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | djuf1olem.2 | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 〈𝑋, 𝑥〉) | |
| 2 | djuf1olem.1 | . . . . . 6 ⊢ 𝑋 ∈ V | |
| 3 | 2 | snid 3654 | . . . . 5 ⊢ 𝑋 ∈ {𝑋} |
| 4 | opelxpi 4696 | . . . . 5 ⊢ ((𝑋 ∈ {𝑋} ∧ 𝑥 ∈ 𝐴) → 〈𝑋, 𝑥〉 ∈ ({𝑋} × 𝐴)) | |
| 5 | 3, 4 | mpan 424 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → 〈𝑋, 𝑥〉 ∈ ({𝑋} × 𝐴)) |
| 6 | 5 | adantl 277 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐴) → 〈𝑋, 𝑥〉 ∈ ({𝑋} × 𝐴)) |
| 7 | xp2nd 6233 | . . . 4 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (2nd ‘𝑦) ∈ 𝐴) | |
| 8 | 7 | adantl 277 | . . 3 ⊢ ((⊤ ∧ 𝑦 ∈ ({𝑋} × 𝐴)) → (2nd ‘𝑦) ∈ 𝐴) |
| 9 | 1st2nd2 6242 | . . . . . . . 8 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → 𝑦 = 〈(1st ‘𝑦), (2nd ‘𝑦)〉) | |
| 10 | xp1st 6232 | . . . . . . . . . 10 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (1st ‘𝑦) ∈ {𝑋}) | |
| 11 | elsni 3641 | . . . . . . . . . 10 ⊢ ((1st ‘𝑦) ∈ {𝑋} → (1st ‘𝑦) = 𝑋) | |
| 12 | 10, 11 | syl 14 | . . . . . . . . 9 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (1st ‘𝑦) = 𝑋) |
| 13 | 12 | opeq1d 3815 | . . . . . . . 8 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → 〈(1st ‘𝑦), (2nd ‘𝑦)〉 = 〈𝑋, (2nd ‘𝑦)〉) |
| 14 | 9, 13 | eqtrd 2229 | . . . . . . 7 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → 𝑦 = 〈𝑋, (2nd ‘𝑦)〉) |
| 15 | 14 | eqeq2d 2208 | . . . . . 6 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (〈𝑋, 𝑥〉 = 𝑦 ↔ 〈𝑋, 𝑥〉 = 〈𝑋, (2nd ‘𝑦)〉)) |
| 16 | eqcom 2198 | . . . . . 6 ⊢ (〈𝑋, 𝑥〉 = 𝑦 ↔ 𝑦 = 〈𝑋, 𝑥〉) | |
| 17 | eqid 2196 | . . . . . . 7 ⊢ 𝑋 = 𝑋 | |
| 18 | vex 2766 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 19 | 2, 18 | opth 4271 | . . . . . . 7 ⊢ (〈𝑋, 𝑥〉 = 〈𝑋, (2nd ‘𝑦)〉 ↔ (𝑋 = 𝑋 ∧ 𝑥 = (2nd ‘𝑦))) |
| 20 | 17, 19 | mpbiran 942 | . . . . . 6 ⊢ (〈𝑋, 𝑥〉 = 〈𝑋, (2nd ‘𝑦)〉 ↔ 𝑥 = (2nd ‘𝑦)) |
| 21 | 15, 16, 20 | 3bitr3g 222 | . . . . 5 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (𝑦 = 〈𝑋, 𝑥〉 ↔ 𝑥 = (2nd ‘𝑦))) |
| 22 | 21 | bicomd 141 | . . . 4 ⊢ (𝑦 ∈ ({𝑋} × 𝐴) → (𝑥 = (2nd ‘𝑦) ↔ 𝑦 = 〈𝑋, 𝑥〉)) |
| 23 | 22 | ad2antll 491 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ ({𝑋} × 𝐴))) → (𝑥 = (2nd ‘𝑦) ↔ 𝑦 = 〈𝑋, 𝑥〉)) |
| 24 | 1, 6, 8, 23 | f1o2d 6132 | . 2 ⊢ (⊤ → 𝐹:𝐴–1-1-onto→({𝑋} × 𝐴)) |
| 25 | 24 | mptru 1373 | 1 ⊢ 𝐹:𝐴–1-1-onto→({𝑋} × 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 = wceq 1364 ⊤wtru 1365 ∈ wcel 2167 Vcvv 2763 {csn 3623 〈cop 3626 ↦ cmpt 4095 × cxp 4662 –1-1-onto→wf1o 5258 ‘cfv 5259 1st c1st 6205 2nd c2nd 6206 |
| 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 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-v 2765 df-sbc 2990 df-un 3161 df-in 3163 df-ss 3170 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-br 4035 df-opab 4096 df-mpt 4097 df-id 4329 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-1st 6207 df-2nd 6208 |
| This theorem is referenced by: djuf1olemr 7129 djulf1o 7133 djurf1o 7134 |
| Copyright terms: Public domain | W3C validator |