Theorem isfild 23867

Description: Sufficient condition for a set of the form {𝑥 ∈ 𝒫 𝐴 ∣ 𝜑} to be a filter. (Contributed by Mario Carneiro, 1-Dec-2013.) (Revised by Stefan O'Rear, 2-Aug-2015.) (Revised by AV, 10-Apr-2024.)

Hypotheses

Ref	Expression
isfild.1	⊢ (𝜑 → (𝑥 ∈ 𝐹 ↔ (𝑥 ⊆ 𝐴 ∧ 𝜓)))
isfild.2	⊢ (𝜑 → 𝐴 ∈ 𝑉)
isfild.3	⊢ (𝜑 → [𝐴 / 𝑥]𝜓)
isfild.4	⊢ (𝜑 → ¬ [∅ / 𝑥]𝜓)
isfild.5	⊢ ((𝜑 ∧ 𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝑦) → ([𝑧 / 𝑥]𝜓 → [𝑦 / 𝑥]𝜓))
isfild.6	⊢ ((𝜑 ∧ 𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝐴) → (([𝑦 / 𝑥]𝜓 ∧ [𝑧 / 𝑥]𝜓) → [(𝑦 ∩ 𝑧) / 𝑥]𝜓))

Assertion

Ref	Expression
isfild	⊢ (𝜑 → 𝐹 ∈ (Fil‘𝐴))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑧,𝐴   𝑥,𝐹,𝑦   𝑦,𝑧,𝐹   𝜑,𝑥,𝑦   𝜑,𝑧   𝜓,𝑦

Allowed substitution hints:   𝜓(𝑥,𝑧)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem isfild

Step	Hyp	Ref	Expression
1		isfild.1	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐹 ↔ (𝑥 ⊆ 𝐴 ∧ 𝜓)))
2		velpw 4604	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
3	2	biimpri 228	. . . . . 6 ⊢ (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝒫 𝐴)
4	3	adantr 480	. . . . 5 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝜓) → 𝑥 ∈ 𝒫 𝐴)
5	1, 4	biimtrdi 253	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐹 → 𝑥 ∈ 𝒫 𝐴))
6	5	ssrdv 3988	. . 3 ⊢ (𝜑 → 𝐹 ⊆ 𝒫 𝐴)
7		isfild.4	. . . 4 ⊢ (𝜑 → ¬ [∅ / 𝑥]𝜓)
8		isfild.2	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
9	1, 8	isfildlem 23866	. . . . 5 ⊢ (𝜑 → (∅ ∈ 𝐹 ↔ (∅ ⊆ 𝐴 ∧ [∅ / 𝑥]𝜓)))
10		simpr 484	. . . . 5 ⊢ ((∅ ⊆ 𝐴 ∧ [∅ / 𝑥]𝜓) → [∅ / 𝑥]𝜓)
11	9, 10	biimtrdi 253	. . . 4 ⊢ (𝜑 → (∅ ∈ 𝐹 → [∅ / 𝑥]𝜓))
12	7, 11	mtod 198	. . 3 ⊢ (𝜑 → ¬ ∅ ∈ 𝐹)
13		isfild.3	. . . . 5 ⊢ (𝜑 → [𝐴 / 𝑥]𝜓)
14		ssid 4005	. . . . 5 ⊢ 𝐴 ⊆ 𝐴
15	13, 14	jctil 519	. . . 4 ⊢ (𝜑 → (𝐴 ⊆ 𝐴 ∧ [𝐴 / 𝑥]𝜓))
16	1, 8	isfildlem 23866	. . . 4 ⊢ (𝜑 → (𝐴 ∈ 𝐹 ↔ (𝐴 ⊆ 𝐴 ∧ [𝐴 / 𝑥]𝜓)))
17	15, 16	mpbird 257	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐹)
18	6, 12, 17	3jca 1128	. 2 ⊢ (𝜑 → (𝐹 ⊆ 𝒫 𝐴 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝐴 ∈ 𝐹))
19		elpwi 4606	. . . 4 ⊢ (𝑦 ∈ 𝒫 𝐴 → 𝑦 ⊆ 𝐴)
20		isfild.5	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝑦) → ([𝑧 / 𝑥]𝜓 → [𝑦 / 𝑥]𝜓))
21		simp2 1137	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝑦) → 𝑦 ⊆ 𝐴)
22	20, 21	jctild 525	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝑦) → ([𝑧 / 𝑥]𝜓 → (𝑦 ⊆ 𝐴 ∧ [𝑦 / 𝑥]𝜓)))
23	22	adantld 490	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝑦) → ((𝑧 ⊆ 𝐴 ∧ [𝑧 / 𝑥]𝜓) → (𝑦 ⊆ 𝐴 ∧ [𝑦 / 𝑥]𝜓)))
24	1, 8	isfildlem 23866	. . . . . . . . . 10 ⊢ (𝜑 → (𝑧 ∈ 𝐹 ↔ (𝑧 ⊆ 𝐴 ∧ [𝑧 / 𝑥]𝜓)))
25	24	3ad2ant1 1133	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝑦) → (𝑧 ∈ 𝐹 ↔ (𝑧 ⊆ 𝐴 ∧ [𝑧 / 𝑥]𝜓)))
26	1, 8	isfildlem 23866	. . . . . . . . . 10 ⊢ (𝜑 → (𝑦 ∈ 𝐹 ↔ (𝑦 ⊆ 𝐴 ∧ [𝑦 / 𝑥]𝜓)))
27	26	3ad2ant1 1133	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝑦) → (𝑦 ∈ 𝐹 ↔ (𝑦 ⊆ 𝐴 ∧ [𝑦 / 𝑥]𝜓)))
28	23, 25, 27	3imtr4d 294	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝑦) → (𝑧 ∈ 𝐹 → 𝑦 ∈ 𝐹))
29	28	3expa 1118	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ⊆ 𝐴) ∧ 𝑧 ⊆ 𝑦) → (𝑧 ∈ 𝐹 → 𝑦 ∈ 𝐹))
30	29	impancom 451	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ⊆ 𝐴) ∧ 𝑧 ∈ 𝐹) → (𝑧 ⊆ 𝑦 → 𝑦 ∈ 𝐹))
31	30	rexlimdva 3154	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ⊆ 𝐴) → (∃𝑧 ∈ 𝐹 𝑧 ⊆ 𝑦 → 𝑦 ∈ 𝐹))
32	31	ex 412	. . . 4 ⊢ (𝜑 → (𝑦 ⊆ 𝐴 → (∃𝑧 ∈ 𝐹 𝑧 ⊆ 𝑦 → 𝑦 ∈ 𝐹)))
33	19, 32	syl5 34	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝒫 𝐴 → (∃𝑧 ∈ 𝐹 𝑧 ⊆ 𝑦 → 𝑦 ∈ 𝐹)))
34	33	ralrimiv 3144	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(∃𝑧 ∈ 𝐹 𝑧 ⊆ 𝑦 → 𝑦 ∈ 𝐹))
35		ssinss1 4245	. . . . . . 7 ⊢ (𝑦 ⊆ 𝐴 → (𝑦 ∩ 𝑧) ⊆ 𝐴)
36	35	ad2antrr 726	. . . . . 6 ⊢ (((𝑦 ⊆ 𝐴 ∧ [𝑦 / 𝑥]𝜓) ∧ (𝑧 ⊆ 𝐴 ∧ [𝑧 / 𝑥]𝜓)) → (𝑦 ∩ 𝑧) ⊆ 𝐴)
37	36	a1i 11	. . . . 5 ⊢ (𝜑 → (((𝑦 ⊆ 𝐴 ∧ [𝑦 / 𝑥]𝜓) ∧ (𝑧 ⊆ 𝐴 ∧ [𝑧 / 𝑥]𝜓)) → (𝑦 ∩ 𝑧) ⊆ 𝐴))
38		an4 656	. . . . . 6 ⊢ (((𝑦 ⊆ 𝐴 ∧ [𝑦 / 𝑥]𝜓) ∧ (𝑧 ⊆ 𝐴 ∧ [𝑧 / 𝑥]𝜓)) ↔ ((𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝐴) ∧ ([𝑦 / 𝑥]𝜓 ∧ [𝑧 / 𝑥]𝜓)))
39		isfild.6	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝐴) → (([𝑦 / 𝑥]𝜓 ∧ [𝑧 / 𝑥]𝜓) → [(𝑦 ∩ 𝑧) / 𝑥]𝜓))
40	39	3expb 1120	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝐴)) → (([𝑦 / 𝑥]𝜓 ∧ [𝑧 / 𝑥]𝜓) → [(𝑦 ∩ 𝑧) / 𝑥]𝜓))
41	40	expimpd 453	. . . . . 6 ⊢ (𝜑 → (((𝑦 ⊆ 𝐴 ∧ 𝑧 ⊆ 𝐴) ∧ ([𝑦 / 𝑥]𝜓 ∧ [𝑧 / 𝑥]𝜓)) → [(𝑦 ∩ 𝑧) / 𝑥]𝜓))
42	38, 41	biimtrid 242	. . . . 5 ⊢ (𝜑 → (((𝑦 ⊆ 𝐴 ∧ [𝑦 / 𝑥]𝜓) ∧ (𝑧 ⊆ 𝐴 ∧ [𝑧 / 𝑥]𝜓)) → [(𝑦 ∩ 𝑧) / 𝑥]𝜓))
43	37, 42	jcad 512	. . . 4 ⊢ (𝜑 → (((𝑦 ⊆ 𝐴 ∧ [𝑦 / 𝑥]𝜓) ∧ (𝑧 ⊆ 𝐴 ∧ [𝑧 / 𝑥]𝜓)) → ((𝑦 ∩ 𝑧) ⊆ 𝐴 ∧ [(𝑦 ∩ 𝑧) / 𝑥]𝜓)))
44	26, 24	anbi12d 632	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐹 ∧ 𝑧 ∈ 𝐹) ↔ ((𝑦 ⊆ 𝐴 ∧ [𝑦 / 𝑥]𝜓) ∧ (𝑧 ⊆ 𝐴 ∧ [𝑧 / 𝑥]𝜓))))
45	1, 8	isfildlem 23866	. . . 4 ⊢ (𝜑 → ((𝑦 ∩ 𝑧) ∈ 𝐹 ↔ ((𝑦 ∩ 𝑧) ⊆ 𝐴 ∧ [(𝑦 ∩ 𝑧) / 𝑥]𝜓)))
46	43, 44, 45	3imtr4d 294	. . 3 ⊢ (𝜑 → ((𝑦 ∈ 𝐹 ∧ 𝑧 ∈ 𝐹) → (𝑦 ∩ 𝑧) ∈ 𝐹))
47	46	ralrimivv 3199	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐹 ∀𝑧 ∈ 𝐹 (𝑦 ∩ 𝑧) ∈ 𝐹)
48		isfil2 23865	. 2 ⊢ (𝐹 ∈ (Fil‘𝐴) ↔ ((𝐹 ⊆ 𝒫 𝐴 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝐴 ∈ 𝐹) ∧ ∀𝑦 ∈ 𝒫 𝐴(∃𝑧 ∈ 𝐹 𝑧 ⊆ 𝑦 → 𝑦 ∈ 𝐹) ∧ ∀𝑦 ∈ 𝐹 ∀𝑧 ∈ 𝐹 (𝑦 ∩ 𝑧) ∈ 𝐹))
49	18, 34, 47, 48	syl3anbrc 1343	1 ⊢ (𝜑 → 𝐹 ∈ (Fil‘𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   ∈ wcel 2107  ∀wral 3060  ∃wrex 3069  [wsbc 3787   ∩ cin 3949   ⊆ wss 3950  ∅c0 4332  𝒫 cpw 4599  ‘cfv 6560  Filcfil 23854

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-iota 6513  df-fun 6562  df-fv 6568  df-fbas 21362  df-fil 23855

This theorem is referenced by:  snfil  23873  fgcl  23887  filuni  23894  cfinfil  23902  csdfil  23903  supfil  23904  fin1aufil  23941