| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ipole | Structured version Visualization version GIF version | ||
| Description: Weak order condition of the inclusion poset. (Contributed by Stefan O'Rear, 30-Jan-2015.) |
| Ref | Expression |
|---|---|
| ipoval.i | ⊢ 𝐼 = (toInc‘𝐹) |
| ipole.l | ⊢ ≤ = (le‘𝐼) |
| Ref | Expression |
|---|---|
| ipole | ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 ≤ 𝑌 ↔ 𝑋 ⊆ 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | preq12 4696 | . . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → {𝑥, 𝑦} = {𝑋, 𝑌}) | |
| 2 | 1 | sseq1d 3944 | . . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ({𝑥, 𝑦} ⊆ 𝐹 ↔ {𝑋, 𝑌} ⊆ 𝐹)) |
| 3 | sseq12 3940 | . . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥 ⊆ 𝑦 ↔ 𝑋 ⊆ 𝑌)) | |
| 4 | 2, 3 | anbi12d 644 | . . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦) ↔ ({𝑋, 𝑌} ⊆ 𝐹 ∧ 𝑋 ⊆ 𝑌))) |
| 5 | eqid 2763 | . . . 4 ⊢ {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)} = {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)} | |
| 6 | 4, 5 | brabga 5512 | . . 3 ⊢ ((𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}𝑌 ↔ ({𝑋, 𝑌} ⊆ 𝐹 ∧ 𝑋 ⊆ 𝑌))) |
| 7 | 6 | 3adant1 1148 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}𝑌 ↔ ({𝑋, 𝑌} ⊆ 𝐹 ∧ 𝑋 ⊆ 𝑌))) |
| 8 | ipole.l | . . . . 5 ⊢ ≤ = (le‘𝐼) | |
| 9 | ipoval.i | . . . . . 6 ⊢ 𝐼 = (toInc‘𝐹) | |
| 10 | 9 | ipolerval 18735 | . . . . 5 ⊢ (𝐹 ∈ 𝑉 → {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)} = (le‘𝐼)) |
| 11 | 8, 10 | eqtr4id 2817 | . . . 4 ⊢ (𝐹 ∈ 𝑉 → ≤ = {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}) |
| 12 | 11 | breqd 5117 | . . 3 ⊢ (𝐹 ∈ 𝑉 → (𝑋 ≤ 𝑌 ↔ 𝑋{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}𝑌)) |
| 13 | 12 | 3ad2ant1 1151 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 ≤ 𝑌 ↔ 𝑋{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}𝑌)) |
| 14 | prssi 4780 | . . . 4 ⊢ ((𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → {𝑋, 𝑌} ⊆ 𝐹) | |
| 15 | 14 | 3adant1 1148 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → {𝑋, 𝑌} ⊆ 𝐹) |
| 16 | 15 | biantrurd 542 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 ⊆ 𝑌 ↔ ({𝑋, 𝑌} ⊆ 𝐹 ∧ 𝑋 ⊆ 𝑌))) |
| 17 | 7, 13, 16 | 3bitr4d 314 | 1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑋 ∈ 𝐹 ∧ 𝑌 ∈ 𝐹) → (𝑋 ≤ 𝑌 ↔ 𝑋 ⊆ 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 {cpr 4590 class class class wbr 5106 {copab 5170 ‘cfv 6558 lecple 17464 toInccipo 18730 |
| 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 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| 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-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 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-3 12433 df-4 12434 df-5 12435 df-6 12436 df-7 12437 df-8 12438 df-9 12439 df-n0 12634 df-z 12721 df-dec 12842 df-uz 12993 df-fz 13667 df-struct 17354 df-slot 17389 df-ndx 17401 df-base 17417 df-tset 17476 df-ple 17477 df-ocomp 17478 df-ipo 18731 |
| This theorem is used by: ipolt 18738 ipopos 18739 isipodrs 18740 ipodrsfi 18742 mrelatglb 18763 mrelatglb0 18764 mrelatlub 18765 thlleval 22034 pwrssmgc 33631 nsgmgc 34033 ipolublem 50305 ipoglblem 50308 |
| Copyright terms: Public domain | W3C validator |