| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > frege102d | Structured version Visualization version GIF version | ||
| Description: If either 𝐴 and 𝐶 are the same or 𝐶 follows 𝐴 in the transitive closure of 𝑅 and 𝐵 is the successor to 𝐶, then 𝐵 follows 𝐴 in the transitive closure of 𝑅. Similar to Proposition 102 of [Frege1879] p. 72. Compare with frege102 44965. (Contributed by RP, 15-Jul-2020.) |
| Ref | Expression |
|---|---|
| frege102d.r | ⊢ (𝜑 → 𝑅 ∈ V) |
| frege102d.a | ⊢ (𝜑 → 𝐴 ∈ V) |
| frege102d.b | ⊢ (𝜑 → 𝐵 ∈ V) |
| frege102d.c | ⊢ (𝜑 → 𝐶 ∈ V) |
| frege102d.ac | ⊢ (𝜑 → (𝐴(t+‘𝑅)𝐶 ∨ 𝐴 = 𝐶)) |
| frege102d.cb | ⊢ (𝜑 → 𝐶𝑅𝐵) |
| Ref | Expression |
|---|---|
| frege102d | ⊢ (𝜑 → 𝐴(t+‘𝑅)𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frege102d.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ V) | |
| 2 | 1 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝐴(t+‘𝑅)𝐶) → 𝑅 ∈ V) |
| 3 | frege102d.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ V) | |
| 4 | 3 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝐴(t+‘𝑅)𝐶) → 𝐴 ∈ V) |
| 5 | frege102d.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ V) | |
| 6 | 5 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝐴(t+‘𝑅)𝐶) → 𝐵 ∈ V) |
| 7 | frege102d.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ V) | |
| 8 | 7 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝐴(t+‘𝑅)𝐶) → 𝐶 ∈ V) |
| 9 | simpr 490 | . . 3 ⊢ ((𝜑 ∧ 𝐴(t+‘𝑅)𝐶) → 𝐴(t+‘𝑅)𝐶) | |
| 10 | frege102d.cb | . . . 4 ⊢ (𝜑 → 𝐶𝑅𝐵) | |
| 11 | 10 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝐴(t+‘𝑅)𝐶) → 𝐶𝑅𝐵) |
| 12 | 2, 4, 6, 8, 9, 11 | frege96d 44749 | . 2 ⊢ ((𝜑 ∧ 𝐴(t+‘𝑅)𝐶) → 𝐴(t+‘𝑅)𝐵) |
| 13 | 1 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝑅 ∈ V) |
| 14 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 = 𝐶) | |
| 15 | 10 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐶𝑅𝐵) |
| 16 | 14, 15 | eqbrtrd 5126 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴𝑅𝐵) |
| 17 | 13, 16 | frege91d 44751 | . 2 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴(t+‘𝑅)𝐵) |
| 18 | frege102d.ac | . 2 ⊢ (𝜑 → (𝐴(t+‘𝑅)𝐶 ∨ 𝐴 = 𝐶)) | |
| 19 | 12, 17, 18 | mpjaodan 973 | 1 ⊢ (𝜑 → 𝐴(t+‘𝑅)𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1569 ∈ wcel 2144 Vcvv 3450 class class class wbr 5102 ‘cfv 6538 t+ctcl 15138 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-iota 6494 df-fun 6540 df-fv 6546 df-trcl 15140 |
| This theorem is used by: frege108d 44756 |
| Copyright terms: Public domain | W3C validator |