| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > sprssspr | Structured version Visualization version GIF version | ||
| Description: The set of all unordered pairs over a given set 𝑉 is a subset of the set of all unordered pairs. (Contributed by AV, 21-Nov-2021.) |
| Ref | Expression |
|---|---|
| sprssspr | ⊢ (Pairs‘𝑉) ⊆ {𝑝 ∣ ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏}} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sprval 47939 | . . 3 ⊢ (𝑉 ∈ V → (Pairs‘𝑉) = {𝑝 ∣ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}}) | |
| 2 | r2ex 3174 | . . . . . . 7 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏} ↔ ∃𝑎∃𝑏((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ 𝑝 = {𝑎, 𝑏})) | |
| 3 | simpr 484 | . . . . . . . 8 ⊢ (((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ 𝑝 = {𝑎, 𝑏}) → 𝑝 = {𝑎, 𝑏}) | |
| 4 | 3 | 2eximi 1838 | . . . . . . 7 ⊢ (∃𝑎∃𝑏((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ 𝑝 = {𝑎, 𝑏}) → ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏}) |
| 5 | 2, 4 | sylbi 217 | . . . . . 6 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏} → ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏}) |
| 6 | 5 | ax-gen 1797 | . . . . 5 ⊢ ∀𝑝(∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏} → ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏}) |
| 7 | 6 | a1i 11 | . . . 4 ⊢ (𝑉 ∈ V → ∀𝑝(∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏} → ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏})) |
| 8 | ss2ab 4001 | . . . 4 ⊢ ({𝑝 ∣ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}} ⊆ {𝑝 ∣ ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏}} ↔ ∀𝑝(∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏} → ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏})) | |
| 9 | 7, 8 | sylibr 234 | . . 3 ⊢ (𝑉 ∈ V → {𝑝 ∣ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}} ⊆ {𝑝 ∣ ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏}}) |
| 10 | 1, 9 | eqsstrd 3956 | . 2 ⊢ (𝑉 ∈ V → (Pairs‘𝑉) ⊆ {𝑝 ∣ ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏}}) |
| 11 | fvprc 6832 | . . 3 ⊢ (¬ 𝑉 ∈ V → (Pairs‘𝑉) = ∅) | |
| 12 | 0ss 4340 | . . . 4 ⊢ ∅ ⊆ {𝑝 ∣ ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏}} | |
| 13 | 12 | a1i 11 | . . 3 ⊢ (¬ 𝑉 ∈ V → ∅ ⊆ {𝑝 ∣ ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏}}) |
| 14 | 11, 13 | eqsstrd 3956 | . 2 ⊢ (¬ 𝑉 ∈ V → (Pairs‘𝑉) ⊆ {𝑝 ∣ ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏}}) |
| 15 | 10, 14 | pm2.61i 182 | 1 ⊢ (Pairs‘𝑉) ⊆ {𝑝 ∣ ∃𝑎∃𝑏 𝑝 = {𝑎, 𝑏}} |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∀wal 1540 = wceq 1542 ∃wex 1781 ∈ wcel 2114 {cab 2714 ∃wrex 3061 Vcvv 3429 ⊆ wss 3889 ∅c0 4273 {cpr 4569 ‘cfv 6498 Pairscspr 47937 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-iota 6454 df-fun 6500 df-fv 6506 df-spr 47938 |
| This theorem is referenced by: spr0el 47942 |
| Copyright terms: Public domain | W3C validator |