| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > prproropreud | Structured version Visualization version GIF version | ||
| Description: There is exactly one ordered ordered pair fulfilling a wff iff there is exactly one proper pair fulfilling an equivalent wff. (Contributed by AV, 20-Mar-2023.) |
| Ref | Expression |
|---|---|
| prproropreud.o | ⊢ 𝑂 = (𝑅 ∩ (𝑉 × 𝑉)) |
| prproropreud.p | ⊢ 𝑃 = {𝑝 ∈ 𝒫 𝑉 ∣ (♯‘𝑝) = 2} |
| prproropreud.b | ⊢ (𝜑 → 𝑅 Or 𝑉) |
| prproropreud.x | ⊢ (𝑥 = 〈inf(𝑦, 𝑉, 𝑅), sup(𝑦, 𝑉, 𝑅)〉 → (𝜓 ↔ 𝜒)) |
| prproropreud.z | ⊢ (𝑥 = 𝑧 → (𝜓 ↔ 𝜃)) |
| Ref | Expression |
|---|---|
| prproropreud | ⊢ (𝜑 → (∃!𝑥 ∈ 𝑂 𝜓 ↔ ∃!𝑦 ∈ 𝑃 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prproropreud.b | . . . 4 ⊢ (𝜑 → 𝑅 Or 𝑉) | |
| 2 | prproropreud.o | . . . . 5 ⊢ 𝑂 = (𝑅 ∩ (𝑉 × 𝑉)) | |
| 3 | prproropreud.p | . . . . 5 ⊢ 𝑃 = {𝑝 ∈ 𝒫 𝑉 ∣ (♯‘𝑝) = 2} | |
| 4 | eqid 2763 | . . . . 5 ⊢ (𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉) = (𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉) | |
| 5 | 2, 3, 4 | prproropf1o 48923 | . . . 4 ⊢ (𝑅 Or 𝑉 → (𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉):𝑃⟶1-1onto𝑂) |
| 6 | 1, 5 | syl 18 | . . 3 ⊢ (𝜑 → (𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉):𝑃⟶1-1onto𝑂) |
| 7 | sbceq1a 3753 | . . . 4 ⊢ (𝑥 = ((𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉)‘𝑦) → (𝜓 ↔ [((𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉)‘𝑦) / 𝑥]𝜓)) | |
| 8 | 7 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = ((𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉)‘𝑦)) → (𝜓 ↔ [((𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉)‘𝑦) / 𝑥]𝜓)) |
| 9 | prproropreud.z | . . 3 ⊢ (𝑥 = 𝑧 → (𝜓 ↔ 𝜃)) | |
| 10 | nfsbc1v 3762 | . . 3 ⊢ Ⅎ𝑥[((𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉)‘𝑦) / 𝑥]𝜓 | |
| 11 | 6, 8, 9, 10 | reuf1odnf 48512 | . 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝑂 𝜓 ↔ ∃!𝑦 ∈ 𝑃 [((𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉)‘𝑦) / 𝑥]𝜓)) |
| 12 | eqidd 2764 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑃) → (𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉) = (𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉)) | |
| 13 | infeq1 9506 | . . . . . . . 8 ⊢ (𝑝 = 𝑦 → inf(𝑝, 𝑉, 𝑅) = inf(𝑦, 𝑉, 𝑅)) | |
| 14 | supeq1 9474 | . . . . . . . 8 ⊢ (𝑝 = 𝑦 → sup(𝑝, 𝑉, 𝑅) = sup(𝑦, 𝑉, 𝑅)) | |
| 15 | 13, 14 | opeq12d 4853 | . . . . . . 7 ⊢ (𝑝 = 𝑦 → 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉 = 〈inf(𝑦, 𝑉, 𝑅), sup(𝑦, 𝑉, 𝑅)〉) |
| 16 | 15 | adantl 487 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑝 = 𝑦) → 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉 = 〈inf(𝑦, 𝑉, 𝑅), sup(𝑦, 𝑉, 𝑅)〉) |
| 17 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑃) → 𝑦 ∈ 𝑃) | |
| 18 | opex 5439 | . . . . . . 7 ⊢ 〈inf(𝑦, 𝑉, 𝑅), sup(𝑦, 𝑉, 𝑅)〉 ∈ V | |
| 19 | 18 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑃) → 〈inf(𝑦, 𝑉, 𝑅), sup(𝑦, 𝑉, 𝑅)〉 ∈ V) |
| 20 | 12, 16, 17, 19 | fvmptd 7032 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑃) → ((𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉)‘𝑦) = 〈inf(𝑦, 𝑉, 𝑅), sup(𝑦, 𝑉, 𝑅)〉) |
| 21 | 20 | sbceq1d 3747 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑃) → ([((𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉)‘𝑦) / 𝑥]𝜓 ↔ [〈inf(𝑦, 𝑉, 𝑅), sup(𝑦, 𝑉, 𝑅)〉 / 𝑥]𝜓)) |
| 22 | prproropreud.x | . . . . . 6 ⊢ (𝑥 = 〈inf(𝑦, 𝑉, 𝑅), sup(𝑦, 𝑉, 𝑅)〉 → (𝜓 ↔ 𝜒)) | |
| 23 | 22 | sbcieg 3781 | . . . . 5 ⊢ (〈inf(𝑦, 𝑉, 𝑅), sup(𝑦, 𝑉, 𝑅)〉 ∈ V → ([〈inf(𝑦, 𝑉, 𝑅), sup(𝑦, 𝑉, 𝑅)〉 / 𝑥]𝜓 ↔ 𝜒)) |
| 24 | 19, 23 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑃) → ([〈inf(𝑦, 𝑉, 𝑅), sup(𝑦, 𝑉, 𝑅)〉 / 𝑥]𝜓 ↔ 𝜒)) |
| 25 | 21, 24 | bitrd 282 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑃) → ([((𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉)‘𝑦) / 𝑥]𝜓 ↔ 𝜒)) |
| 26 | 25 | reubidva 3383 | . 2 ⊢ (𝜑 → (∃!𝑦 ∈ 𝑃 [((𝑝 ∈ 𝑃 ↦ 〈inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)〉)‘𝑦) / 𝑥]𝜓 ↔ ∃!𝑦 ∈ 𝑃 𝜒)) |
| 27 | 11, 26 | bitrd 282 | 1 ⊢ (𝜑 → (∃!𝑥 ∈ 𝑂 𝜓 ↔ ∃!𝑦 ∈ 𝑃 𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∃!wreu 3367 {crab 3416 Vcvv 3454 [wsbc 3742 ∩ cin 4092 𝒫 cpw 4560 〈cop 4840 ↦ cmpt 5192 Or wor 5565 × cxp 5656 ⟶1-1ontowf1o 6565 ‘cfv 6566 supcsup 9469 infcinf 9470 2c2 12437 ♯chash 14515 |
| 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-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 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-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 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-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 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-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-oadd 8518 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-inf 9472 df-dju 10019 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-hash 14516 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |