![]() |
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 43148 | . . 3 ⊢ ((𝐵 ∈ 𝑈 ∧ 𝐸 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (𝐵(t+‘𝑅)𝐸 ↔ 𝐸 ∈ ∩ {𝑓 ∣ (𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓})) | |
5 | 1, 2, 3, 4 | mp3an 1458 | . 2 ⊢ (𝐵(t+‘𝑅)𝐸 ↔ 𝐸 ∈ ∩ {𝑓 ∣ (𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓}) |
6 | 2 | elexi 3490 | . . 3 ⊢ 𝐸 ∈ V |
7 | 6 | elintab 4957 | . 2 ⊢ (𝐸 ∈ ∩ {𝑓 ∣ (𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓} ↔ ∀𝑓((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 → 𝐸 ∈ 𝑓)) |
8 | imaundi 6149 | . . . . . . . . 9 ⊢ (𝑅 “ ({𝐵} ∪ 𝑓)) = ((𝑅 “ {𝐵}) ∪ (𝑅 “ 𝑓)) | |
9 | 8 | equncomi 4152 | . . . . . . . 8 ⊢ (𝑅 “ ({𝐵} ∪ 𝑓)) = ((𝑅 “ 𝑓) ∪ (𝑅 “ {𝐵})) |
10 | 9 | sseq1i 4007 | . . . . . . 7 ⊢ ((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 ↔ ((𝑅 “ 𝑓) ∪ (𝑅 “ {𝐵})) ⊆ 𝑓) |
11 | unss 4181 | . . . . . . 7 ⊢ (((𝑅 “ 𝑓) ⊆ 𝑓 ∧ (𝑅 “ {𝐵}) ⊆ 𝑓) ↔ ((𝑅 “ 𝑓) ∪ (𝑅 “ {𝐵})) ⊆ 𝑓) | |
12 | 10, 11 | bitr4i 278 | . . . . . 6 ⊢ ((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 ↔ ((𝑅 “ 𝑓) ⊆ 𝑓 ∧ (𝑅 “ {𝐵}) ⊆ 𝑓)) |
13 | df-he 43194 | . . . . . . . 8 ⊢ (𝑅 hereditary 𝑓 ↔ (𝑅 “ 𝑓) ⊆ 𝑓) | |
14 | 13 | bicomi 223 | . . . . . . 7 ⊢ ((𝑅 “ 𝑓) ⊆ 𝑓 ↔ 𝑅 hereditary 𝑓) |
15 | dfss2 3965 | . . . . . . . 8 ⊢ ((𝑅 “ {𝐵}) ⊆ 𝑓 ↔ ∀𝑎(𝑎 ∈ (𝑅 “ {𝐵}) → 𝑎 ∈ 𝑓)) | |
16 | 1 | elexi 3490 | . . . . . . . . . . . 12 ⊢ 𝐵 ∈ V |
17 | vex 3474 | . . . . . . . . . . . 12 ⊢ 𝑎 ∈ V | |
18 | 16, 17 | elimasn 6088 | . . . . . . . . . . 11 ⊢ (𝑎 ∈ (𝑅 “ {𝐵}) ↔ 〈𝐵, 𝑎〉 ∈ 𝑅) |
19 | df-br 5144 | . . . . . . . . . . 11 ⊢ (𝐵𝑅𝑎 ↔ 〈𝐵, 𝑎〉 ∈ 𝑅) | |
20 | 18, 19 | bitr4i 278 | . . . . . . . . . 10 ⊢ (𝑎 ∈ (𝑅 “ {𝐵}) ↔ 𝐵𝑅𝑎) |
21 | 20 | imbi1i 349 | . . . . . . . . 9 ⊢ ((𝑎 ∈ (𝑅 “ {𝐵}) → 𝑎 ∈ 𝑓) ↔ (𝐵𝑅𝑎 → 𝑎 ∈ 𝑓)) |
22 | 21 | albii 1814 | . . . . . . . 8 ⊢ (∀𝑎(𝑎 ∈ (𝑅 “ {𝐵}) → 𝑎 ∈ 𝑓) ↔ ∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓)) |
23 | 15, 22 | bitri 275 | . . . . . . 7 ⊢ ((𝑅 “ {𝐵}) ⊆ 𝑓 ↔ ∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓)) |
24 | 14, 23 | anbi12i 627 | . . . . . 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 1814 | . 2 ⊢ (∀𝑓((𝑅 “ ({𝐵} ∪ 𝑓)) ⊆ 𝑓 → 𝐸 ∈ 𝑓) ↔ ∀𝑓(𝑅 hereditary 𝑓 → (∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓) → 𝐸 ∈ 𝑓))) |
30 | 5, 7, 29 | 3bitrri 298 | 1 ⊢ (∀𝑓(𝑅 hereditary 𝑓 → (∀𝑎(𝐵𝑅𝑎 → 𝑎 ∈ 𝑓) → 𝐸 ∈ 𝑓)) ↔ 𝐵(t+‘𝑅)𝐸) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∀wal 1532 ∈ wcel 2099 {cab 2705 ∪ cun 3943 ⊆ wss 3945 {csn 4625 〈cop 4631 ∩ cint 4945 class class class wbr 5143 “ cima 5676 ‘cfv 6543 t+ctcl 14959 hereditary whe 43193 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5360 ax-pr 5424 ax-un 7735 ax-cnex 11189 ax-resscn 11190 ax-1cn 11191 ax-icn 11192 ax-addcl 11193 ax-addrcl 11194 ax-mulcl 11195 ax-mulrcl 11196 ax-mulcom 11197 ax-addass 11198 ax-mulass 11199 ax-distr 11200 ax-i2m1 11201 ax-1ne0 11202 ax-1rid 11203 ax-rnegex 11204 ax-rrecex 11205 ax-cnre 11206 ax-pre-lttri 11207 ax-pre-lttrn 11208 ax-pre-ltadd 11209 ax-pre-mulgt0 11210 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2937 df-nel 3043 df-ral 3058 df-rex 3067 df-reu 3373 df-rab 3429 df-v 3472 df-sbc 3776 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3964 df-nul 4320 df-if 4526 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4905 df-int 4946 df-iun 4994 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5571 df-eprel 5577 df-po 5585 df-so 5586 df-fr 5628 df-we 5630 df-xp 5679 df-rel 5680 df-cnv 5681 df-co 5682 df-dm 5683 df-rn 5684 df-res 5685 df-ima 5686 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7371 df-ov 7418 df-oprab 7419 df-mpo 7420 df-om 7866 df-2nd 7989 df-frecs 8281 df-wrecs 8312 df-recs 8386 df-rdg 8425 df-er 8719 df-en 8959 df-dom 8960 df-sdom 8961 df-pnf 11275 df-mnf 11276 df-xr 11277 df-ltxr 11278 df-le 11279 df-sub 11471 df-neg 11472 df-nn 12238 df-2 12300 df-n0 12498 df-z 12584 df-uz 12848 df-seq 13994 df-trcl 14961 df-relexp 14994 df-he 43194 |
This theorem is referenced by: frege77 43361 frege89 43373 |
Copyright terms: Public domain | W3C validator |