| 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 43720 | . . 3 ⊢ ((𝐵 ∈ 𝑈 ∧ 𝐸 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (𝐵(t+‘𝑅)𝐸 ↔ 𝐸 ∈ ∩ {𝑓 ∣ (𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓})) | |
| 5 | 1, 2, 3, 4 | mp3an 1463 | . 2 ⊢ (𝐵(t+‘𝑅)𝐸 ↔ 𝐸 ∈ ∩ {𝑓 ∣ (𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓}) |
| 6 | 2 | elexi 3459 | . . 3 ⊢ 𝐸 ∈ V |
| 7 | 6 | elintab 4908 | . 2 ⊢ (𝐸 ∈ ∩ {𝑓 ∣ (𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓} ↔ ∀𝑓((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 → 𝐸 ∈ 𝑓)) |
| 8 | imaundi 6098 | . . . . . . . . 9 ⊢ (𝑅 “ ({𝐵} ∪ 𝑓)) = ((𝑅 “ {𝐵}) ∪ (𝑅 “ 𝑓)) | |
| 9 | 8 | equncomi 4111 | . . . . . . . 8 ⊢ (𝑅 “ ({𝐵} ∪ 𝑓)) = ((𝑅 “ 𝑓) ∪ (𝑅 “ {𝐵})) |
| 10 | 9 | sseq1i 3964 | . . . . . . 7 ⊢ ((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 ↔ ((𝑅 “ 𝑓) ∪ (𝑅 “ {𝐵})) ⊆ 𝑓) |
| 11 | unss 4141 | . . . . . . 7 ⊢ (((𝑅 “ 𝑓) ⊆ 𝑓 ∧ (𝑅 “ {𝐵}) ⊆ 𝑓) ↔ ((𝑅 “ 𝑓) ∪ (𝑅 “ {𝐵})) ⊆ 𝑓) | |
| 12 | 10, 11 | bitr4i 278 | . . . . . 6 ⊢ ((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 ↔ ((𝑅 “ 𝑓) ⊆ 𝑓 ∧ (𝑅 “ {𝐵}) ⊆ 𝑓)) |
| 13 | df-he 43766 | . . . . . . . 8 ⊢ (𝑅 hereditary 𝑓 ↔ (𝑅 “ 𝑓) ⊆ 𝑓) | |
| 14 | 13 | bicomi 224 | . . . . . . 7 ⊢ ((𝑅 “ 𝑓) ⊆ 𝑓 ↔ 𝑅 hereditary 𝑓) |
| 15 | df-ss 3920 | . . . . . . . 8 ⊢ ((𝑅 “ {𝐵}) ⊆ 𝑓 ↔ ∀𝑎(𝑎 ∈ (𝑅 “ {𝐵}) → 𝑎 ∈ 𝑓)) | |
| 16 | 1 | elexi 3459 | . . . . . . . . . . . 12 ⊢ 𝐵 ∈ V |
| 17 | vex 3440 | . . . . . . . . . . . 12 ⊢ 𝑎 ∈ V | |
| 18 | 16, 17 | elimasn 6041 | . . . . . . . . . . 11 ⊢ (𝑎 ∈ (𝑅 “ {𝐵}) ↔ 〈𝐵, 𝑎〉 ∈ 𝑅) |
| 19 | df-br 5093 | . . . . . . . . . . 11 ⊢ (𝐵𝑅𝑎 ↔ 〈𝐵, 𝑎〉 ∈ 𝑅) | |
| 20 | 18, 19 | bitr4i 278 | . . . . . . . . . 10 ⊢ (𝑎 ∈ (𝑅 “ {𝐵}) ↔ 𝐵𝑅𝑎) |
| 21 | 20 | imbi1i 349 | . . . . . . . . 9 ⊢ ((𝑎 ∈ (𝑅 “ {𝐵}) → 𝑎 ∈ 𝑓) ↔ (𝐵𝑅𝑎 → 𝑎 ∈ 𝑓)) |
| 22 | 21 | albii 1819 | . . . . . . . 8 ⊢ (∀𝑎(𝑎 ∈ (𝑅 “ {𝐵}) → 𝑎 ∈ 𝑓) ↔ ∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓)) |
| 23 | 15, 22 | bitri 275 | . . . . . . 7 ⊢ ((𝑅 “ {𝐵}) ⊆ 𝑓 ↔ ∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓)) |
| 24 | 14, 23 | anbi12i 628 | . . . . . 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 1819 | . 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 1538 ∈ wcel 2109 {cab 2707 ∪ cun 3901 ⊆ wss 3903 {csn 4577 〈cop 4583 ∩ cint 4896 class class class wbr 5092 “ cima 5622 ‘cfv 6482 t+ctcl 14892 hereditary whe 43765 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-int 4897 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-nn 12129 df-2 12191 df-n0 12385 df-z 12472 df-uz 12736 df-seq 13909 df-trcl 14894 df-relexp 14927 df-he 43766 |
| This theorem is referenced by: frege77 43933 frege89 43945 |
| Copyright terms: Public domain | W3C validator |