| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > frege133d | Structured version Visualization version GIF version | ||
| Description: If 𝐹 is a function and 𝐴 and 𝐵 both follow 𝑋 in the transitive closure of 𝐹, then (for distinct 𝐴 and 𝐵) either 𝐴 follows 𝐵 or 𝐵 follows 𝐴 in the transitive closure of 𝐹 (or both if it loops). Similar to Proposition 133 of [Frege1879] p. 86. Compare with frege133 45318. (Contributed by RP, 18-Jul-2020.) |
| Ref | Expression |
|---|---|
| frege133d.f | ⊢ (𝜑 → 𝐹 ∈ V) |
| frege133d.xa | ⊢ (𝜑 → 𝑋(t+‘𝐹)𝐴) |
| frege133d.xb | ⊢ (𝜑 → 𝑋(t+‘𝐹)𝐵) |
| frege133d.fun | ⊢ (𝜑 → Fun 𝐹) |
| Ref | Expression |
|---|---|
| frege133d | ⊢ (𝜑 → (𝐴(t+‘𝐹)𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵(t+‘𝐹)𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frege133d.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ V) | |
| 2 | frege133d.xb | . . . . 5 ⊢ (𝜑 → 𝑋(t+‘𝐹)𝐵) | |
| 3 | frege133d.fun | . . . . . . . 8 ⊢ (𝜑 → Fun 𝐹) | |
| 4 | funrel 6584 | . . . . . . . 8 ⊢ (Fun 𝐹 → Rel 𝐹) | |
| 5 | 3, 4 | syl 18 | . . . . . . 7 ⊢ (𝜑 → Rel 𝐹) |
| 6 | reltrclfv 15213 | . . . . . . 7 ⊢ ((𝐹 ∈ V ∧ Rel 𝐹) → Rel (t+‘𝐹)) | |
| 7 | 1, 5, 6 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → Rel (t+‘𝐹)) |
| 8 | eliniseg2 6120 | . . . . . 6 ⊢ (Rel (t+‘𝐹) → (𝑋 ∈ (◡(t+‘𝐹) “ {𝐵}) ↔ 𝑋(t+‘𝐹)𝐵)) | |
| 9 | 7, 8 | syl 18 | . . . . 5 ⊢ (𝜑 → (𝑋 ∈ (◡(t+‘𝐹) “ {𝐵}) ↔ 𝑋(t+‘𝐹)𝐵)) |
| 10 | 2, 9 | mpbird 260 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ (◡(t+‘𝐹) “ {𝐵})) |
| 11 | frege133d.xa | . . . . 5 ⊢ (𝜑 → 𝑋(t+‘𝐹)𝐴) | |
| 12 | brrelex2 5712 | . . . . 5 ⊢ ((Rel (t+‘𝐹) ∧ 𝑋(t+‘𝐹)𝐴) → 𝐴 ∈ V) | |
| 13 | 7, 11, 12 | syl2anc 596 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ V) |
| 14 | un12 4174 | . . . . . 6 ⊢ ((◡(t+‘𝐹) “ {𝐵}) ∪ ({𝐵} ∪ ((t+‘𝐹) “ {𝐵}))) = ({𝐵} ∪ ((◡(t+‘𝐹) “ {𝐵}) ∪ ((t+‘𝐹) “ {𝐵}))) | |
| 15 | 14 | a1i 11 | . . . . 5 ⊢ (𝜑 → ((◡(t+‘𝐹) “ {𝐵}) ∪ ({𝐵} ∪ ((t+‘𝐹) “ {𝐵}))) = ({𝐵} ∪ ((◡(t+‘𝐹) “ {𝐵}) ∪ ((t+‘𝐹) “ {𝐵})))) |
| 16 | 1, 15, 3 | frege131d 45086 | . . . 4 ⊢ (𝜑 → (𝐹 “ ((◡(t+‘𝐹) “ {𝐵}) ∪ ({𝐵} ∪ ((t+‘𝐹) “ {𝐵})))) ⊆ ((◡(t+‘𝐹) “ {𝐵}) ∪ ({𝐵} ∪ ((t+‘𝐹) “ {𝐵})))) |
| 17 | 1, 10, 13, 11, 16 | frege83d 45070 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ((◡(t+‘𝐹) “ {𝐵}) ∪ ({𝐵} ∪ ((t+‘𝐹) “ {𝐵})))) |
| 18 | elun 4155 | . . . . 5 ⊢ (𝐴 ∈ ({𝐵} ∪ ((t+‘𝐹) “ {𝐵})) ↔ (𝐴 ∈ {𝐵} ∨ 𝐴 ∈ ((t+‘𝐹) “ {𝐵}))) | |
| 19 | 18 | orbi2i 926 | . . . 4 ⊢ ((𝐴 ∈ (◡(t+‘𝐹) “ {𝐵}) ∨ 𝐴 ∈ ({𝐵} ∪ ((t+‘𝐹) “ {𝐵}))) ↔ (𝐴 ∈ (◡(t+‘𝐹) “ {𝐵}) ∨ (𝐴 ∈ {𝐵} ∨ 𝐴 ∈ ((t+‘𝐹) “ {𝐵})))) |
| 20 | elun 4155 | . . . 4 ⊢ (𝐴 ∈ ((◡(t+‘𝐹) “ {𝐵}) ∪ ({𝐵} ∪ ((t+‘𝐹) “ {𝐵}))) ↔ (𝐴 ∈ (◡(t+‘𝐹) “ {𝐵}) ∨ 𝐴 ∈ ({𝐵} ∪ ((t+‘𝐹) “ {𝐵})))) | |
| 21 | 3orass 1106 | . . . 4 ⊢ ((𝐴 ∈ (◡(t+‘𝐹) “ {𝐵}) ∨ 𝐴 ∈ {𝐵} ∨ 𝐴 ∈ ((t+‘𝐹) “ {𝐵})) ↔ (𝐴 ∈ (◡(t+‘𝐹) “ {𝐵}) ∨ (𝐴 ∈ {𝐵} ∨ 𝐴 ∈ ((t+‘𝐹) “ {𝐵})))) | |
| 22 | 19, 20, 21 | 3bitr4i 306 | . . 3 ⊢ (𝐴 ∈ ((◡(t+‘𝐹) “ {𝐵}) ∪ ({𝐵} ∪ ((t+‘𝐹) “ {𝐵}))) ↔ (𝐴 ∈ (◡(t+‘𝐹) “ {𝐵}) ∨ 𝐴 ∈ {𝐵} ∨ 𝐴 ∈ ((t+‘𝐹) “ {𝐵}))) |
| 23 | 17, 22 | sylib 221 | . 2 ⊢ (𝜑 → (𝐴 ∈ (◡(t+‘𝐹) “ {𝐵}) ∨ 𝐴 ∈ {𝐵} ∨ 𝐴 ∈ ((t+‘𝐹) “ {𝐵}))) |
| 24 | eliniseg2 6120 | . . . . 5 ⊢ (Rel (t+‘𝐹) → (𝐴 ∈ (◡(t+‘𝐹) “ {𝐵}) ↔ 𝐴(t+‘𝐹)𝐵)) | |
| 25 | 7, 24 | syl 18 | . . . 4 ⊢ (𝜑 → (𝐴 ∈ (◡(t+‘𝐹) “ {𝐵}) ↔ 𝐴(t+‘𝐹)𝐵)) |
| 26 | 25 | biimpd 232 | . . 3 ⊢ (𝜑 → (𝐴 ∈ (◡(t+‘𝐹) “ {𝐵}) → 𝐴(t+‘𝐹)𝐵)) |
| 27 | elsni 4601 | . . . 4 ⊢ (𝐴 ∈ {𝐵} → 𝐴 = 𝐵) | |
| 28 | 27 | a1i 11 | . . 3 ⊢ (𝜑 → (𝐴 ∈ {𝐵} → 𝐴 = 𝐵)) |
| 29 | elrelimasn 6102 | . . . . 5 ⊢ (Rel (t+‘𝐹) → (𝐴 ∈ ((t+‘𝐹) “ {𝐵}) ↔ 𝐵(t+‘𝐹)𝐴)) | |
| 30 | 7, 29 | syl 18 | . . . 4 ⊢ (𝜑 → (𝐴 ∈ ((t+‘𝐹) “ {𝐵}) ↔ 𝐵(t+‘𝐹)𝐴)) |
| 31 | 30 | biimpd 232 | . . 3 ⊢ (𝜑 → (𝐴 ∈ ((t+‘𝐹) “ {𝐵}) → 𝐵(t+‘𝐹)𝐴)) |
| 32 | 26, 28, 31 | 3orim123d 1473 | . 2 ⊢ (𝜑 → ((𝐴 ∈ (◡(t+‘𝐹) “ {𝐵}) ∨ 𝐴 ∈ {𝐵} ∨ 𝐴 ∈ ((t+‘𝐹) “ {𝐵})) → (𝐴(t+‘𝐹)𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵(t+‘𝐹)𝐴))) |
| 33 | 23, 32 | mpd 16 | 1 ⊢ (𝜑 → (𝐴(t+‘𝐹)𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵(t+‘𝐹)𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∨ wo 861 ∨ w3o 1102 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ∪ cun 4152 {csn 4588 class class class wbr 5108 ◡ccnv 5657 “ cima 5661 Rel wrel 5663 Fun wfun 6560 ‘cfv 6566 t+ctcl 15181 |
| 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 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-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-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 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-seq 14185 df-trcl 15183 df-relexp 15216 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |