| 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 44870. (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 44654 | . 2 ⊢ ((𝜑 ∧ 𝐴(t+‘𝑅)𝐶) → 𝐴(t+‘𝑅)𝐵) |
| 13 | 1 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝑅 ∈ V) |
| 14 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 = 𝐶) | |
| 15 | 10 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐶𝑅𝐵) |
| 16 | 14, 15 | eqbrtrd 5127 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴𝑅𝐵) |
| 17 | 13, 16 | frege91d 44656 | . 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 1570 ∈ wcel 2145 Vcvv 3450 class class class wbr 5103 ‘cfv 6535 t+ctcl 15083 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7742 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-iota 6491 df-fun 6537 df-fv 6543 df-trcl 15085 |
| This theorem is used by: frege108d 44661 |
| Copyright terms: Public domain | W3C validator |