| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dffrege76 | Structured version Visualization version GIF version | ||
| Description: If from the two
propositions that every result of an application of
the procedure 𝑅 to 𝐵 has property 𝑓 and
that property
𝑓 is hereditary in the 𝑅-sequence, it can be inferred,
whatever 𝑓 may be, that 𝐸 has property 𝑓, then
we say
𝐸 follows 𝐵 in the 𝑅-sequence. Definition 76 of
[Frege1879] p. 60.
Each of 𝐵, 𝐸 and 𝑅 must be sets. (Contributed by RP, 2-Jul-2020.) |
| Ref | Expression |
|---|---|
| frege76.b | ⊢ 𝐵 ∈ 𝑈 |
| frege76.e | ⊢ 𝐸 ∈ 𝑉 |
| frege76.r | ⊢ 𝑅 ∈ 𝑊 |
| Ref | Expression |
|---|---|
| dffrege76 | ⊢ (∀𝑓(𝑅 hereditary 𝑓 → (∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓) → 𝐸 ∈ 𝑓)) ↔ 𝐵(t+‘𝑅)𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frege76.b | . . 3 ⊢ 𝐵 ∈ 𝑈 | |
| 2 | frege76.e | . . 3 ⊢ 𝐸 ∈ 𝑉 | |
| 3 | frege76.r | . . 3 ⊢ 𝑅 ∈ 𝑊 | |
| 4 | brtrclfv2 44142 | . . 3 ⊢ ((𝐵 ∈ 𝑈 ∧ 𝐸 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (𝐵(t+‘𝑅)𝐸 ↔ 𝐸 ∈ ∩ {𝑓 ∣ (𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓})) | |
| 5 | 1, 2, 3, 4 | mp3an 1464 | . 2 ⊢ (𝐵(t+‘𝑅)𝐸 ↔ 𝐸 ∈ ∩ {𝑓 ∣ (𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓}) |
| 6 | 2 | elexi 3450 | . . 3 ⊢ 𝐸 ∈ V |
| 7 | 6 | elintab 4891 | . 2 ⊢ (𝐸 ∈ ∩ {𝑓 ∣ (𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓} ↔ ∀𝑓((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 → 𝐸 ∈ 𝑓)) |
| 8 | imaundi 6102 | . . . . . . . . 9 ⊢ (𝑅 “ ({𝐵} ∪ 𝑓)) = ((𝑅 “ {𝐵}) ∪ (𝑅 “ 𝑓)) | |
| 9 | 8 | equncomi 4092 | . . . . . . . 8 ⊢ (𝑅 “ ({𝐵} ∪ 𝑓)) = ((𝑅 “ 𝑓) ∪ (𝑅 “ {𝐵})) |
| 10 | 9 | sseq1i 3945 | . . . . . . 7 ⊢ ((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 ↔ ((𝑅 “ 𝑓) ∪ (𝑅 “ {𝐵})) ⊆ 𝑓) |
| 11 | unss 4121 | . . . . . . 7 ⊢ (((𝑅 “ 𝑓) ⊆ 𝑓 ∧ (𝑅 “ {𝐵}) ⊆ 𝑓) ↔ ((𝑅 “ 𝑓) ∪ (𝑅 “ {𝐵})) ⊆ 𝑓) | |
| 12 | 10, 11 | bitr4i 278 | . . . . . 6 ⊢ ((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 ↔ ((𝑅 “ 𝑓) ⊆ 𝑓 ∧ (𝑅 “ {𝐵}) ⊆ 𝑓)) |
| 13 | df-he 44188 | . . . . . . . 8 ⊢ (𝑅 hereditary 𝑓 ↔ (𝑅 “ 𝑓) ⊆ 𝑓) | |
| 14 | 13 | bicomi 224 | . . . . . . 7 ⊢ ((𝑅 “ 𝑓) ⊆ 𝑓 ↔ 𝑅 hereditary 𝑓) |
| 15 | df-ss 3902 | . . . . . . . 8 ⊢ ((𝑅 “ {𝐵}) ⊆ 𝑓 ↔ ∀𝑎(𝑎 ∈ (𝑅 “ {𝐵}) → 𝑎 ∈ 𝑓)) | |
| 16 | 1 | elexi 3450 | . . . . . . . . . . . 12 ⊢ 𝐵 ∈ V |
| 17 | vex 3431 | . . . . . . . . . . . 12 ⊢ 𝑎 ∈ V | |
| 18 | 16, 17 | elimasn 6044 | . . . . . . . . . . 11 ⊢ (𝑎 ∈ (𝑅 “ {𝐵}) ↔ 〈𝐵, 𝑎〉 ∈ 𝑅) |
| 19 | df-br 5075 | . . . . . . . . . . 11 ⊢ (𝐵𝑅𝑎 ↔ 〈𝐵, 𝑎〉 ∈ 𝑅) | |
| 20 | 18, 19 | bitr4i 278 | . . . . . . . . . 10 ⊢ (𝑎 ∈ (𝑅 “ {𝐵}) ↔ 𝐵𝑅𝑎) |
| 21 | 20 | imbi1i 349 | . . . . . . . . 9 ⊢ ((𝑎 ∈ (𝑅 “ {𝐵}) → 𝑎 ∈ 𝑓) ↔ (𝐵𝑅𝑎 → 𝑎 ∈ 𝑓)) |
| 22 | 21 | albii 1821 | . . . . . . . 8 ⊢ (∀𝑎(𝑎 ∈ (𝑅 “ {𝐵}) → 𝑎 ∈ 𝑓) ↔ ∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓)) |
| 23 | 15, 22 | bitri 275 | . . . . . . 7 ⊢ ((𝑅 “ {𝐵}) ⊆ 𝑓 ↔ ∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓)) |
| 24 | 14, 23 | anbi12i 629 | . . . . . 6 ⊢ (((𝑅 “ 𝑓) ⊆ 𝑓 ∧ (𝑅 “ {𝐵}) ⊆ 𝑓) ↔ (𝑅 hereditary 𝑓 ∧ ∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓))) |
| 25 | 12, 24 | bitri 275 | . . . . 5 ⊢ ((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 ↔ (𝑅 hereditary 𝑓 ∧ ∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓))) |
| 26 | 25 | imbi1i 349 | . . . 4 ⊢ (((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 → 𝐸 ∈ 𝑓) ↔ ((𝑅 hereditary 𝑓 ∧ ∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓)) → 𝐸 ∈ 𝑓)) |
| 27 | impexp 450 | . . . 4 ⊢ (((𝑅 hereditary 𝑓 ∧ ∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓)) → 𝐸 ∈ 𝑓) ↔ (𝑅 hereditary 𝑓 → (∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓) → 𝐸 ∈ 𝑓))) | |
| 28 | 26, 27 | bitri 275 | . . 3 ⊢ (((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 → 𝐸 ∈ 𝑓) ↔ (𝑅 hereditary 𝑓 → (∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓) → 𝐸 ∈ 𝑓))) |
| 29 | 28 | albii 1821 | . 2 ⊢ (∀𝑓((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 → 𝐸 ∈ 𝑓) ↔ ∀𝑓(𝑅 hereditary 𝑓 → (∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓) → 𝐸 ∈ 𝑓))) |
| 30 | 5, 7, 29 | 3bitrri 298 | 1 ⊢ (∀𝑓(𝑅 hereditary 𝑓 → (∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓) → 𝐸 ∈ 𝑓)) ↔ 𝐵(t+‘𝑅)𝐸) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1540 ∈ wcel 2114 {cab 2713 ∪ cun 3883 ⊆ wss 3885 {csn 4557 〈cop 4563 ∩ cint 4879 class class class wbr 5074 “ cima 5623 ‘cfv 6487 t+ctcl 14936 hereditary whe 44187 |
| 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 2184 ax-ext 2707 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3060 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-er 8632 df-en 8883 df-dom 8884 df-sdom 8885 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12164 df-2 12233 df-n0 12427 df-z 12514 df-uz 12778 df-seq 13953 df-trcl 14938 df-relexp 14971 df-he 44188 |
| This theorem is referenced by: frege77 44355 frege89 44367 |
| Copyright terms: Public domain | W3C validator |