| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-imdirvallem | Structured version Visualization version GIF version | ||
| Description: Lemma for bj-imdirval 38370 and bj-iminvval 38382. (Contributed by BJ, 23-May-2024.) |
| Ref | Expression |
|---|---|
| bj-imdirvallem.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑈) |
| bj-imdirvallem.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| bj-imdirvallem.df | ⊢ 𝐶 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑟 ∈ 𝒫 (𝑎 × 𝑏) ↦ {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝑎 ∧ 𝑦 ⊆ 𝑏) ∧ 𝜓)})) |
| Ref | Expression |
|---|---|
| bj-imdirvallem | ⊢ (𝜑 → (𝐴𝐶𝐵) = (𝑟 ∈ 𝒫 (𝐴 × 𝐵) ↦ {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑦 ⊆ 𝐵) ∧ 𝜓)})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bj-imdirvallem.df | . . 3 ⊢ 𝐶 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑟 ∈ 𝒫 (𝑎 × 𝑏) ↦ {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝑎 ∧ 𝑦 ⊆ 𝑏) ∧ 𝜓)})) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝜑 → 𝐶 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑟 ∈ 𝒫 (𝑎 × 𝑏) ↦ {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝑎 ∧ 𝑦 ⊆ 𝑏) ∧ 𝜓)}))) |
| 3 | xpeq12 5683 | . . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (𝑎 × 𝑏) = (𝐴 × 𝐵)) | |
| 4 | 3 | pweqd 4577 | . . . 4 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → 𝒫 (𝑎 × 𝑏) = 𝒫 (𝐴 × 𝐵)) |
| 5 | 4 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑏 = 𝐵)) → 𝒫 (𝑎 × 𝑏) = 𝒫 (𝐴 × 𝐵)) |
| 6 | sseq2 3939 | . . . . . . 7 ⊢ (𝑎 = 𝐴 → (𝑥 ⊆ 𝑎 ↔ 𝑥 ⊆ 𝐴)) | |
| 7 | sseq2 3939 | . . . . . . 7 ⊢ (𝑏 = 𝐵 → (𝑦 ⊆ 𝑏 ↔ 𝑦 ⊆ 𝐵)) | |
| 8 | 6, 7 | bi2anan9 650 | . . . . . 6 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ((𝑥 ⊆ 𝑎 ∧ 𝑦 ⊆ 𝑏) ↔ (𝑥 ⊆ 𝐴 ∧ 𝑦 ⊆ 𝐵))) |
| 9 | 8 | anbi1d 643 | . . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (((𝑥 ⊆ 𝑎 ∧ 𝑦 ⊆ 𝑏) ∧ 𝜓) ↔ ((𝑥 ⊆ 𝐴 ∧ 𝑦 ⊆ 𝐵) ∧ 𝜓))) |
| 10 | 9 | opabbidv 5177 | . . . 4 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝑎 ∧ 𝑦 ⊆ 𝑏) ∧ 𝜓)} = {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑦 ⊆ 𝐵) ∧ 𝜓)}) |
| 11 | 10 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑏 = 𝐵)) → {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝑎 ∧ 𝑦 ⊆ 𝑏) ∧ 𝜓)} = {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑦 ⊆ 𝐵) ∧ 𝜓)}) |
| 12 | 5, 11 | mpteq12dv 5198 | . 2 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑏 = 𝐵)) → (𝑟 ∈ 𝒫 (𝑎 × 𝑏) ↦ {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝑎 ∧ 𝑦 ⊆ 𝑏) ∧ 𝜓)}) = (𝑟 ∈ 𝒫 (𝐴 × 𝐵) ↦ {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑦 ⊆ 𝐵) ∧ 𝜓)})) |
| 13 | bj-imdirvallem.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑈) | |
| 14 | 13 | elexd 3477 | . 2 ⊢ (𝜑 → 𝐴 ∈ V) |
| 15 | bj-imdirvallem.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 16 | 15 | elexd 3477 | . 2 ⊢ (𝜑 → 𝐵 ∈ V) |
| 17 | 13, 15 | xpexd 7797 | . . . 4 ⊢ (𝜑 → (𝐴 × 𝐵) ∈ V) |
| 18 | 17 | pwexd 5348 | . . 3 ⊢ (𝜑 → 𝒫 (𝐴 × 𝐵) ∈ V) |
| 19 | 18 | mptexd 7261 | . 2 ⊢ (𝜑 → (𝑟 ∈ 𝒫 (𝐴 × 𝐵) ↦ {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑦 ⊆ 𝐵) ∧ 𝜓)}) ∈ V) |
| 20 | 2, 12, 14, 16, 19 | ovmpod 7604 | 1 ⊢ (𝜑 → (𝐴𝐶𝐵) = (𝑟 ∈ 𝒫 (𝐴 × 𝐵) ↦ {〈𝑥, 𝑦〉 ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑦 ⊆ 𝐵) ∧ 𝜓)})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ⊆ wss 3900 𝒫 cpw 4560 {copab 5173 ↦ cmpt 5192 × cxp 5656 (class class class)co 7451 ∈ cmpo 7453 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 |
| This theorem is used by: bj-imdirval 38370 bj-iminvval 38382 |
| Copyright terms: Public domain | W3C validator |