| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > reuf1odnf | Structured version Visualization version GIF version | ||
| Description: There is exactly one element in each of two isomorphic sets. Variant of reuf1od 48513 with no distinct variable condition for 𝜒. (Contributed by AV, 19-Mar-2023.) |
| Ref | Expression |
|---|---|
| reuf1odnf.f | ⊢ (𝜑 → 𝐹:𝐶⟶1-1onto𝐵) |
| reuf1odnf.x | ⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ 𝜒)) |
| reuf1odnf.z | ⊢ (𝑥 = 𝑧 → (𝜓 ↔ 𝜃)) |
| reuf1odnf.n | ⊢ Ⅎ𝑥𝜒 |
| Ref | Expression |
|---|---|
| reuf1odnf | ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reuf1odnf.f | . . . . 5 ⊢ (𝜑 → 𝐹:𝐶⟶1-1onto𝐵) | |
| 2 | f1of 6854 | . . . . 5 ⊢ (𝐹:𝐶⟶1-1onto𝐵 → 𝐹:𝐶⟶𝐵) | |
| 3 | 1, 2 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐹:𝐶⟶𝐵) |
| 4 | 3 | ffvelcdmda 7116 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → (𝐹‘𝑦) ∈ 𝐵) |
| 5 | f1ofveu 7445 | . . . . 5 ⊢ ((𝐹:𝐶⟶1-1onto𝐵 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 (𝐹‘𝑦) = 𝑥) | |
| 6 | eqcom 2770 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝑦) ↔ (𝐹‘𝑦) = 𝑥) | |
| 7 | 6 | reubii 3378 | . . . . 5 ⊢ (∃!𝑦 ∈ 𝐶 𝑥 = (𝐹‘𝑦) ↔ ∃!𝑦 ∈ 𝐶 (𝐹‘𝑦) = 𝑥) |
| 8 | 5, 7 | sylibr 237 | . . . 4 ⊢ ((𝐹:𝐶⟶1-1onto𝐵 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 𝑥 = (𝐹‘𝑦)) |
| 9 | 1, 8 | sylan 592 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 𝑥 = (𝐹‘𝑦)) |
| 10 | sbceq1a 3753 | . . . . 5 ⊢ (𝑥 = (𝐹‘𝑦) → (𝜓 ↔ [(𝐹‘𝑦) / 𝑥]𝜓)) | |
| 11 | 10 | adantl 487 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ [(𝐹‘𝑦) / 𝑥]𝜓)) |
| 12 | reuf1odnf.z | . . . . 5 ⊢ (𝑥 = 𝑧 → (𝜓 ↔ 𝜃)) | |
| 13 | 12 | cbvsbcvw 3776 | . . . 4 ⊢ ([(𝐹‘𝑦) / 𝑥]𝜓 ↔ [(𝐹‘𝑦) / 𝑧]𝜃) |
| 14 | 11, 13 | bitrdi 290 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ [(𝐹‘𝑦) / 𝑧]𝜃)) |
| 15 | 4, 9, 14 | reuxfr1d 3711 | . 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑧]𝜃)) |
| 16 | 13 | a1i 11 | . . . 4 ⊢ (𝜑 → ([(𝐹‘𝑦) / 𝑥]𝜓 ↔ [(𝐹‘𝑦) / 𝑧]𝜃)) |
| 17 | 16 | bicomd 226 | . . 3 ⊢ (𝜑 → ([(𝐹‘𝑦) / 𝑧]𝜃 ↔ [(𝐹‘𝑦) / 𝑥]𝜓)) |
| 18 | 17 | reubidv 3385 | . 2 ⊢ (𝜑 → (∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑧]𝜃 ↔ ∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑥]𝜓)) |
| 19 | fvexd 6931 | . . . 4 ⊢ (𝜑 → (𝐹‘𝑦) ∈ V) | |
| 20 | reuf1odnf.x | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ 𝜒)) | |
| 21 | nfv 1949 | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
| 22 | reuf1odnf.n | . . . . 5 ⊢ Ⅎ𝑥𝜒 | |
| 23 | 22 | a1i 11 | . . . 4 ⊢ (𝜑 → Ⅎ𝑥𝜒) |
| 24 | 19, 20, 21, 23 | sbciedf 3784 | . . 3 ⊢ (𝜑 → ([(𝐹‘𝑦) / 𝑥]𝜓 ↔ 𝜒)) |
| 25 | 24 | reubidv 3385 | . 2 ⊢ (𝜑 → (∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑥]𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒)) |
| 26 | 15, 18, 25 | 3bitrd 308 | 1 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2147 ∃!wreu 3367 Vcvv 3454 [wsbc 3742 ⟶wf 6562 ⟶1-1ontowf1o 6565 ‘cfv 6566 |
| 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-sep 5255 ax-nul 5266 ax-pr 5398 |
| 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-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 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 |
| This theorem is used by: prproropreud 48925 |
| Copyright terms: Public domain | W3C validator |